【正文】
he smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine? (n=15) Quiz(10 minutes) Question 1. Use mathematical induction to show that when n is an exact power of 2, the solution of the recurrence is T(n) = nlgn. 2. What is the worstcase running time of a