71. In place merge sort has same time complexity as standard merge sort.
72. Odd-even sort is also known as . . . . . . . .
73. In what position does the array for heap sort contains data?
74. Strand sort is most efficient for data stored in?
75. What is the average time complexity of strand sort?
76. What is the auxiliary space complexity of binary insertion sort?
77. Bubble sort is an adaptive sorting algorithm.
78. How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using pigeonhole sort?
79. The auxiliary array used in pigeonhole sorting is called . . . . . . . .
80. Odd-even sort is a variation of . . . . . . . .
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.