Sorting Algorithms - Study Mode

Show All Answers

[#346] Bead sort is a comparison based sorting algorithm.

(A) true

(B) false

Correct Answer

(B) false

[#347] What is the average case time complexity of permutation sort?

(A) O(n 2 )

(B) O(n*n!)

(C) O(infinity)

(D) O(n log n)

Correct Answer

(B) O(n*n!)

[#348] Library sort is a comparison based sort.

(A) true

(B) false

Correct Answer

(A) true

[#349] Which of the following header file is a must to implement sleep sort algorithm?

(A) string.h

(B) math.hw

(C) bios.h

(D) windows.h

Correct Answer

(D) windows.h

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

(A) radix sort

(B) binary insertion sort

(C) odd-even sort

(D) bead sort

Correct Answer

(B) binary insertion sort