Sorting Algorithms - Study Mode

Show All Answers

[#156] Which of the following algorithm is best suited for the case where swap operation is expensive?

(A) bubble sort

(B) cycle sort

(C) cocktail sort

(D) merge sort

Correct Answer

(B) cycle sort

[#157] What is the space complexity of pigeonhole sort (k=range of input)?

(A) O(n*k)

(B) O(n)

(C) O(k)

(D) O(n+k)

Correct Answer

(D) O(n+k)

[#158] Bottom up merge sort is a stable sort.

(A) true

(B) false

Correct Answer

(A) true

[#159] What is the average case time complexity of odd-even sort?

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

Correct Answer

(C) O(n 2 )

[#160] Which of the following sorting algorithm does not use recursion?

(A) bottom up merge sort

(B) merge sort

(C) heap sort

(D) quick sort

Correct Answer

(A) bottom up merge sort