Sorting Algorithms - Study Mode

Show All Answers

[#376] Strand sort is a stable sorting algorithm.

(A) true

(B) false

Correct Answer

(A) true

[#377] Auxiliary space used by comb sort is . . . . . . . .

(A) O(1)

(B) O(n)

(C) O(log n)

(D) O(n log n)

Correct Answer

(A) O(1)

[#378] Which of the following sorting algorithm requires the use of binary search in their implementation?

(A) radix sort

(B) library sort

(C) odd-even sort

(D) bead sort

Correct Answer

(B) library sort

[#379] What is the best case time complexity Median of three quick sort?

(A) O(log n)

(B) O(n log n)

(C) O(n 2 )

(D) O(n 2 log n)

Correct Answer

(B) O(n log n)

[#380] Tim sort is a comparison based sort.

(A) true

(B) false

Correct Answer

(A) true