Sorting Algorithms - Study Mode

[#466] What is the advantage of comb sort over merge sort?
Correct Answer

(A) Comb sort is an in place sorting algorithm

[#467] Heap sort is an extremely stable algorithm.
Correct Answer

(A) true

[#468] Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
Correct Answer

(B) Statement 2 is true but statement 1 is false

[#469] Choose the correct statement regarding binary insertion sort?
Correct Answer

(D) it takes less number of comparisons in the worst case as compared to the standard version

[#470] Bucket sort is most efficient in the case when . . . . . . . .
Correct Answer

(B) the input is uniformly distributed