Which of the following sorting algorithm will be preferred when the size of partition is between 16 and 2 log(n) while implementing introsort?
(a) quick sort
(b) insertion sort
(c) heap sort
(d) merge sort
The question was asked by my school principal while I was bunking the class.
Origin of the question is Sorting topic in section Sorting of Data Structures & Algorithms II