(b) A recursive algorithm has been developed as shown below: Input: List A = (a,..., ay)...

Transcribed Image Text:

(b) A recursive algorithm has been developed as shown below: Input: List A = (a,..., ay) such that N 1 Output: value x foo(A) if length(A) == 1 return (a * a) A' = (a,..., aN-1) q = foo(A') return q + a State what problem this algorithm solves and write down the two recurrence equations that characterise this recursive algorithm. [8 marks] (b) A recursive algorithm has been developed as shown below: Input: List A = (a,..., ay) such that N 1 Output: value x foo(A) if length(A) == 1 return (a * a) A' = (a,..., aN-1) q = foo(A') return q + a State what problem this algorithm solves and write down the two recurrence equations that characterise this recursive algorithm. [8 marks]

Answer rating: 100% (QA)

This recursive algorithm appears to calculate the sum of squares of elements in a list It takes ... View the full answer