51. 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?
52. Brick sort uses which of the following methods for sorting the input?
53. What is the average time complexity of bead sort (S = sum of input elements)?
54. Which of the following is an advantage of binary insertion sort over its standard version?
55. Sleep sort does gives a correct output when . . . . . . . .
56. Which of the following sorting algorithm is not stable . . . . . . . .
57. Which of the following sorting algorithm is not in-place?
58. Binary insertion sort is a comparison based sort.
59. What is the running time of an insertion sort algorithm if the input is pre-sorted?
60. What is the space complexity of stooge sort?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.