51. What is the time taken to perform a delete min operation?
52. Which of the following uses the largest amount of auxiliary space for sorting?
53. Which of the following is an in-place sorting algorithm?
54. What is the average case time complexity of standard merge sort?
55. What is the average case time complexity of binary insertion sort?
56. What is the best case time complexity of comb sort and bubble sort respectively?
57. Merge sort uses which of the following method to implement sorting?
58. The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.
59. Library sort is an online sorting algorithm.
60. Sleep sort should be preferred over bogosort as it has better time complexity.
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.