Sorting Algorithms - Study Mode

Show All Answers

[#166] Quick sort uses which of the following algorithm to implement sorting?

(A) backtracking

(B) greedy algorithm

(C) divide and conquer

(D) dynamic programming

Correct Answer

(C) divide and conquer

[#167] What is the worst case time complexity of cube sort?

(A) O(n)

(B) O(log n)

(C) O(n log n)

(D) O(n2)

Correct Answer

(C) O(n log n)

[#168] Merge sort can be implemented using O(1) auxiliary space.

(A) true

(B) false

Correct Answer

(A) true

[#169] What will be the best case time complexity of merge sort?

(A) O(n log n)

(B) O(n 2 )

(C) O(n 2 log n)

(D) O(n log n 2 )

Correct Answer

(A) O(n log n)

[#170] Quick sort uses join operation rather than merge operation.

(A) true

(B) false

Correct Answer

(A) true