Question: (d) A recursive algorithm is applied to some data A = (a1, ... , am) where m > 2. The running time T is characterised

 (d) A recursive algorithm is applied to some data A =

(d) A recursive algorithm is applied to some data A = (a1, ... , am) where m > 2. The running time T is characterised using the following recurrence equations: T(2) = c when the size of A is 2 T(m) = T(m 1) + 2c otherwise Determine the running time complexity of this algorithm. [10 marks] (e) Another recursive algorithm is applied to some data A = (a1, ... , am) where m = 2% (i.e. 2, 4, 8,16 ...) where x is an integer > 1. The running time T is characterised using the following recurrence equations: T(1) = c when the size of A is 1 T(m) 2T + c otherwise Determine the running time complexity of this algorithm. [10 marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!