Sorting Algorithms - Study Mode

Show All Answers

[#126] Which of the following is not true about QuickSort?

(A) in-place algorithm

(B) pivot position can be changed

(C) adaptive sorting algorithm

(D) can be implemented as a stable sort

Correct Answer

(B) pivot position can be changed

[#127] What is the average case time complexity of tree sort?

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

Correct Answer

(B) O(n log n)

[#128] Which of the following is an advantage of recursive insertion sort over its iterative version?

(A) it has better time complexity

(B) it has better space complexity

(C) it is easy to implement

(D) it has no significant advantage

Correct Answer

(D) it has no significant advantage

[#129] Consider the following statements related to the binary tree sort. I. Element can be added gradually as they become available II. It needs extra memory space

(A) Statement I is true but Statement II is false

(B) Both Statement I and Statement II are false

(C) Both Statement I and Statement II are true

(D) Statement II is true but Statement I is false

Correct Answer

(C) Both Statement I and Statement II are true

[#130] What is the average time complexity of Tim sort?

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

Correct Answer

(B) O(n log n)