Vidyalelo
Data Structure · Q123

Sorting Algorithms

Programming · Data Structure · question 123

Q123

What is the advantage of comb sort over merge sort?

A.
Comb sort is an in place sorting algorithm
Answer
B.
Comb sort is a stable sorting algorithm
C.
Comb sort is more efficient
D.
It has no advantage

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board