Solutions to Introduction to Algorithms, 3rd edition

2.1. INSERTION SORT ON SMALL ARRAYS IN MERGE SORT 7 2.1.3 c The largest value of k is (log( n)). The running time is ( nk+nlog(n=k)) = ( nlog(n) + nlog(n=log(n))) = ( nlog(n)), which has the same running time as standard merge sort. 2.1.4 d Since k is the

yinyanghu.github.io