What is the advantage of comb sort over merge sort?
(a) Comb sort is an in place sorting algorithm
(b) Comb sort is a stable sorting algorithm
(c) Comb sort is more efficient
(d) It has no advantage
The question was posed to me in class test.
I'd like to ask this question from Sorting topic in section Sorting of Data Structures & Algorithms II