Question: Solve the recurrence relation : T(n) = T(n/2) + n 3 , T(1)=1. 1.Draw the first three levels of the recurrence tree. 2.Solve the recurrence
Solve the recurrence relation : T(n) = T(n/2) + n3, T(1)=1.
1.Draw the first three levels of the recurrence tree.
2.Solve the recurrence to find a formula and find the Big(Oh) complexity.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
