Which of the following sorting algorithm uses a binary search?
(a) radix sort
(b) binary insertion sort
(c) odd-even sort
(d) bead sort
I had been asked this question during an internship interview.
I need to ask this question from Sorting in chapter Sorting of Data Structures & Algorithms II