Question

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

Answer 1

Right choice is (a) Comb sort is an in place sorting algorithm

The best explanation: Comb sort does not require auxiliary space for manipulating input so it is an in place sorting algorithm but merge sort does require O(n) of auxiliary space which makes comb sort better in terms of space complexity.