The recurrence T (n) = 7T (n / 2) + n 2 describes the running time of an algorithm A.
Another algorithm B has a running time of T’(n) = k T’(n/ 4) + n 2 .
(a) Write algorithm to calculate the largest integer value for k such that B is asymptotically
faster than A.
Answers
Answered by
1
sorry I have no idea on this topic
Similar questions