Sorting Algorithms - Study Mode

[#121] Introsort sort is a comparison based sort.
Correct Answer

(A) true

[#122] Which of the following methods is the most effective for picking the pivot element?
Correct Answer

(C) median-of-three partitioning

[#123] What is the average number of comparisons used to heap sort a random permutation of N distinct items?
Correct Answer

(C) 2N log N-O(N log log N)

[#124] Which of the following sorting algorithm is NOT stable?
Correct Answer

(A) Quick sort
(E) Introsort

[#125] On which algorithm is heap sort based on?
Correct Answer

(C) Priority queue