1. What is the worst case time complexity of bucket sort (k = number of buckets)?
2. Shell sort is an improvement on . . . . . . . .
3. What is the worst case time complexity of tree sort (when implemented with an unbalanced tree)?
4. Which of the following algorithm takes non linear time for sorting?
5. Odd-even sort is a comparison based sort.
6. Which of the following is good for sorting arrays having less than 100 elements?
7. Which of the following sorting techniques is most efficient if the range of input data is not significantly greater than a number of elements to be sorted?
8. Quick sort is a space-optimised version of . . . . . . . .
9. What is the average time complexity of MSD radix sort (w= bits required to store each key)?
10. What is the average time complexity of stooge sort?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.