I have this question and not sure if i answer it properly
return S[x] + SumU(S,x+1,y)
i was asked to give the recurrence relation for the time taken to sum a length -n set of values from S and give the recursive and base cases?
Im not sure if T(n) = n-1
base case T(1) = 0
if you can explain how can i do this properly and easily cuz i don't understand the way done in the book?