Why is Insertion sort better than Quick sort for small list of elements?

Question

Isn\'t Insertion sort O(n^2) > Quicksort O(n log n)...so for a small n, won\'t the relation be the same?

Answer 1

How about binary insertion sort? You can absolutely search the position to swap by using binary search.