61. An array that is first 7-sorted, then 5-sorted becomes . . . . . . . .
62. How many recursive statements are used in the algorithm of stooge sort?
63. In how many comparisons does the array arr={1, 4, 2, 3, 5} gets sorted if we use sleep sort?
64. What is the worst case time complexity of introsort?
65. Which of the following is correct with regard to insertion sort?
66. What is the space complexity of in place merge sort?
67. Sleep sort works by . . . . . . . .
68. Heap sort is faster than Shell sort.
69. Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order.
Statement 2: And these elements are the m smallest elements in the array.
Statement 2: And these elements are the m smallest elements in the array.
70. What is the average time complexity of randomized quick sort?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.