$2-1$ Insertion sort on small arrays in merge sort

Although merge sort runs in $.$n lg n$/$ worst$-$case time and insertion sort runs

in $.$n$2$

$/$ worst$-$case time, the constant factors in insertion sort can make it faster

in practice for small problem sizes on many machines