I need to Sum up an array using Recursion however, I need to do 2 recursions. Sum off the first half then the second half then add them together and them add the middle to get the sum.

does this seem okay?

Code:int sum (int a[]. int n) if (n==0) return 0; int sumFirstHalf = sum2(a, (n/2) -1) int sumSecondHalf = sum3(a, (n/2 +1) return a[n-1] + sumFirstHalf + sumeSecondHalf;