Sorting Algorithms - Study Mode

Show All Answers

[#271] Which of the following sorting algorithm uses a binary search tree?

(A) radix sort

(B) tree sort

(C) odd-even sort

(D) bead sort

Correct Answer

(B) tree sort

[#272] What is the worst case time complexity of a quick sort algorithm?

(A) O(N)

(B) O(N log N)

(C) O(N 2 )

(D) O(log N)

Correct Answer

(C) O(N 2 )

[#273] What is the auxiliary space complexity of recursive bubble sort?

(A) O(n)

(B) O(1)

(C) O(n log n)

(D) O(n 2 )

Correct Answer

(B) O(1)

[#274] In place merge sort has same time complexity as standard merge sort.

(A) true

(B) false

Correct Answer

(B) false

[#275] Odd-even sort is also known as . . . . . . . .

(A) stupid sort

(B) smart sort

(C) brick sort

(D) bogo sort

Correct Answer

(C) brick sort