Algorithms Homework – Fall 2000

Insertion sort beats merge sort for inputs of the following size: 2 ( n ( 43 Merge sort can be improved by calling Insertion sort for inputs that are within these bounds. 1.4-2 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? ................
................