81. What is the auxiliary space complexity of strand sort?
82. What is the average case complexity of QuickSort?
83. How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?
84. Cube sort is a comparison based sort.
85. The given array is arr = {1, 2, 3, 4, 5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are . . . . . . . .
86. Which of the following sorting algorithm is worst in terms of time complexity?
87. What is the best case complexity of selection sort?
88. Strand sort is a comparison based sorting algorithm.
89. Bubble sort is also known as . . . . . . . .
90. Which of the following non-comparison sort can also be considered as a comparison based sort?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.