Sorting

Consider n = 5, insertion sort does 10 comparisons, mergesort does 8 but lg 5! = lg 120 = 7, hence the lower bound is better than merge sort does. Try to find a sort of 5 keys in 7 comparisons in worst case. ................
................