Sorting Algorithms - Study Mode

Show All Answers

[#436] What is the worst case time complexity of bucket sort (k = number of buckets)?

(A) O(n + k)

(B) O(n.k)

(C) O(n 2 )

(D) O(n log n)

Correct Answer

(C) O(n 2 )

[#437] Shell sort is an improvement on . . . . . . . .

(A) insertion sort

(B) selection sort

(C) binary tree sort

(D) quick sort

Correct Answer

(A) insertion sort

[#438] What is the worst case time complexity of tree sort (when implemented with an unbalanced tree)?

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

Correct Answer

(C) O(n 2 )

[#439] Which of the following algorithm takes non linear time for sorting?

(A) counting sort

(B) quick sort

(C) bucket sort

(D) radix sort

Correct Answer

(B) quick sort

[#440] Odd-even sort is a comparison based sort.

(A) true

(B) false

Correct Answer

(A) true