Sorting Algorithms - Study Mode

Show All Answers

[#351] Cocktail sort is a comparison based sort.

(A) True

(B) False

Correct Answer

(A) True

[#352] Cycle sort is a comparison based sort.

(A) true

(B) false

Correct Answer

(A) true

[#353] What is the best case time complexity randomized 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)

[#354] Which of the following data structure is required for the implementation of tree sort?

(A) any ordinary tree

(B) balanced tree

(C) binary search tree

(D) unbalanced tree

Correct Answer

(C) binary search tree

[#355] What is the average number of comparisons used in a heap sort algorithm?

(A) N log N-O(N)

(B) O(N log N)-O(N)

(C) O(N log N)-1

(D) 2N log N + O(N)

Correct Answer

(D) 2N log N + O(N)