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 64n lg n steps. For which values of n does insertion sort beat merge sort?

Answer 1

Since you are to find when insertion sort beats merge sort 8n^2<= 64nlogn n^2<=8nlogn n<=8logn. On solving n -8logn ...

Answer 2

Answer:

Explanation:

Since you are to find when insertion sort beats merge sort 8n^2<= 64nlogn n^2<=8nlogn n<=8logn. On solving n -8logn ...