# Exercise 1.2.2

Suppose we are comparing implementations of insetion 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 $ 64n\lg{n} $ steps. For which values of $n$ does insertion sort beat merge sort?

At $ n > 43 $ merge sort beats insertion sort.