计算机算法导论_第3章.pptVIP

Introduction to Algorithms 计算机算法导论 2007~2008年第一学期 Quiz(10 minutes) Question Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort? (n44) What is the 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 Use mathematical induction to show that when n is an exact power of 2, t