To sort a list of n = 128 elements, Merge Sort requires roughly n log(n) = 128 comparisons, and Insertion Sort n*n = 16,192 comparisons.

What is wrong with:

efficiency(n) = O(2n + log n)

It should be simplified to:

efficiency(n) = O(2n)