31. Pigeonhole sort is an in place sorting algorithm.
32. Which of the following pair of sorting algorithms are stable?
33. Auxiliary space requirement of odd-even sort is . . . . . . . .
34. Which of the following is an example of an unstable sorting algorithm?
35. Bead sort is a comparison based sorting algorithm.
36. Which of the following sorting algorithm is not in place?
37. What is the average case time complexity of permutation sort?
38. Library sort is a comparison based sort.
39. Which of the following header file is a must to implement sleep sort algorithm?
40. Which of the following sorting algorithm uses a binary search?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.