(d) A recursive algorithm is applied to some data A = (a1,..., am) where m ...

 

Transcribed Image Text:

(d) A recursive algorithm is applied to some data A = (a1,..., am) where m ≥ 3 and m is divisible by 3. The running time T is characterised using the following recurrence equations: T(3) T(m) = c when the size of A is 3 T(m-3) + c otherwise Determine the running time complexity of this algorithm. Note that mis divisible by 3 and the problem size reduces by 3 for each recursion. [10 marks] (d) A recursive algorithm is applied to some data A = (a1,..., am) where m ≥ 3 and m is divisible by 3. The running time T is characterised using the following recurrence equations: T(3) T(m) = c when the size of A is 3 T(m-3) + c otherwise Determine the running time complexity of this algorithm. Note that mis divisible by 3 and the problem size reduces by 3 for each recursion. [10 marks]

Answer rating: 100% (QA)

S13 The recurrence relasiom Base case Whem the size of the imput array 11 3 the rumming t... View the full answer