91. What is the auxiliary space complexity of tree sort?
92. What is the best case time complexity of cycle sort?
93. Which of the following algorithm is best suited for the case where swap operation is expensive?
94. What is the space complexity of pigeonhole sort (k=range of input)?
95. Bottom up merge sort is a stable sort.
96. Which of the following sorting algorithm is NOT stable?
97. What is the average case time complexity of odd-even sort?
98. Which of the following sorting algorithm does not use recursion?
99. Which of the following is a variation of bubble sort?
100. The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.