I don't understand the hypothesis part
where T(n/2) = (n/2)*log(n/2) please help me through that part (The
induction step). I only know you have to substitute any T(n/2) with
(n/2)*log(n/2).
Using an inductive proof, show that when n is an exact power of 2 , the solution of the recurrence is n \log _{2} n Start with the base case n=2 , followed by the hypothesis T(n /