Sorting Algorithms - Study Mode
[#236] The essential part of Heap sort is construction of max-heap. Consider the tree shown below, the node 24 violates the max-heap property. Once heapify procedure is applied to it, which position will it be in?
Correct Answer
(D) 9
[#237] Brick sort uses which of the following methods for sorting the input?
Correct Answer
(D) exchanging
[#238] What is the average time complexity of bead sort (S = sum of input elements)?
Correct Answer
(B) O(S)
[#239] Which of the following is an advantage of binary insertion sort over its standard version?
Correct Answer
(C) it makes less number of comparisons
[#240] Sleep sort does gives a correct output when . . . . . . . .
Correct Answer
(C) any input element is positive