Which of the following sorting techniques is most efficient if the range of input data is not significantly greater than a number of elements to be sorted?
(a) selection sort
(b) bubble sort
(c) counting sort
(d) insertion sort
The question was posed to me in an internship interview.
This interesting question is from Sorting in portion Sorting of Data Structures & Algorithms II