Suppose we are comparing implementations of insertion sort and merge sort on the same machine For inputs of size n, insertion sort runs in 8n 2 steps, while merge sort runs in 64 n lg n steps For which values of n does insertion sort beat merge sort ...

The problem essentially is comparing two quantities 8n 2 and 64nlog e n assuming natural log If it is not natural log you can easily extrapolate this ...

Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs

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 8n² steps, while merge sort runs in 64_n lg _n steps. For which values of n does insertion sort beat merge sort?

Fantastic news! We've Found the answer you've been seeking!