An algorithm processes an array of size n by operating on its first one-third, its second one-third, its third one-third, and th
en operating on its third one-third again, recursively. It theån combines the solutions in 21gn time. Derive a recurrence for the running time of above algorithm. You may assume that n=3k for some positive integer k. Use an appropriate method (just pick one method) to solve the recurrence by finding a tight upper and lower bound solution for the recurrence. You must show the procedure of calculation.
1 answer:
You might be interested in
