Which of the following sorting algorithm requires the use of binary search in their implementation?
(a) radix sort
(b) library sort
(c) odd-even sort
(d) bead sort
I got this question during a job interview.
Asked question is from Sorting in portion Sorting of Data Structures & Algorithms II