51. Which of the following is not a variant of merge sort?
52. Consider an array of length 5, arr[5] = {9, 7, 4, 2, 1}. What are the steps of insertions done while running insertion sort on the array?
53. When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through . . . . . . . .
54. How many passes does an insertion sort algorithm consist of?
55. A machine needs a minimum of 200 sec to sort 1000 elements by Quick sort. The minimum time needed to sort 200 elements will be approximately . . . . . . . .
56. The descending heap property is . . . . . . . .
57. What is the usual size of a run in tim sort?
58. What is the full form of MSD in MSD radix sort?
59. Sleep sort should be preferred over permutation sort as it has better time complexity.
60. Introsort algorithm is combination of . . . . . . . .
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.