61. Bubble sort performs better as compared to cocktail sort.
62. Which of the following is an advantage of cycle sort?
63. Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?
64. Sleep sort is an in-place sorting technique.
65. Which of the following sorting techniques is stable?
66. Which of the following sorting algorithm makes use of merge sort?
67. Merge sort uses which of the following algorithm to implement sorting?
68. What is the average time complexity of bottom up merge sort?
69. Which of the following is a combination of LSD and MSD radix sorts?
70. How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using counting sort?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.