Question: please urgent Q3. Solve the following recursive relation (using back substitution & recursion tree) and find its complexity; 1. T(n)=T(n1)+log(n) 2. T(n)=2T(n/2)+n2
please urgent
Q3. Solve the following recursive relation (using back substitution & recursion tree) and find its complexity; 1. T(n)=T(n1)+log(n) 2. T(n)=2T(n/2)+n2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
