Which of the following algorithm is best suited for the case where swap operation is expensive?
(a) bubble sort
(b) cycle sort
(c) cocktail sort
(d) merge sort
I got this question during an internship interview.
Origin of the question is Sorting in division Sorting of Data Structures & Algorithms II