1. In the following scenarios, when will you use selection sort?
2. What is the first step in the algorithm of stooge sort(after base case)?
3. The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
4. The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
5. What will be the order of elements of the array arr = {23, 67, 143, 654, 43} after first iteration of MSD sort is complete?
6. Which of the following sorting algorithm is most closely related to the OS?
7. Why is Shell sort called as a generalization of Insertion sort?
8. Which of the following is an alternate name of MSD radix sort?
9. Given an array of the following elements
81, 94, 11, 96, 12, 35, 17, 95, 28, 58, 41, 75, 15.
What will be the sorted order after 5-sort?
81, 94, 11, 96, 12, 35, 17, 95, 28, 58, 41, 75, 15.
What will be the sorted order after 5-sort?
10. What is the cut-off for switching from quick sort to insertion sort in the implementation of introsort?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.