Recursive insertion sort is a comparison based sort.
Select an option to see the answer and solution.
Data Structure · all questionsSorting Algorithms
Sorting Algorithms
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
509
Questions
5/26
Page
Pick an option on a question to see the right answer and solution.
Which of the following real time examples is based on insertion sort?
Select an option to see the answer and solution.
Consider the following heap after buildheap phase. What will be its corresponding array?
Select an option to see the answer and solution.
Bottom up merge sort uses recursion.
Select an option to see the answer and solution.
Cocktail sort is also known as . . . . . . . .
Select an option to see the answer and solution.
What is the average running time of a quick sort algorithm?
Select an option to see the answer and solution.
Sleep sort code cannot compile online because . . . . . . . .
Select an option to see the answer and solution.
Which of the following sorting algorithm uses a binary search tree?
Select an option to see the answer and solution.
What is the worst case time complexity of a quick sort algorithm?
Select an option to see the answer and solution.
What is the auxiliary space complexity of recursive bubble sort?
Select an option to see the answer and solution.
Comb sort is a stable sorting algorithm.
Select an option to see the answer and solution.
What is the auxiliary space complexity of library sort?
Select an option to see the answer and solution.
Choose the correct statement from the following.
Select an option to see the answer and solution.
What is the average time complexity of the median of three quick sort?
Select an option to see the answer and solution.
Which of the following is not in place sorting algorithm by default?
Select an option to see the answer and solution.
What is the auxiliary space requirement of cube sort?
Select an option to see the answer and solution.
Auxiliary space requirement of cocktail sort is . . . . . . . .
Select an option to see the answer and solution.
What is the best case time complexity of library sort?
Select an option to see the answer and solution.
Choose the incorrect statement about merge sort from the following?
Select an option to see the answer and solution.
Q100
Open questionWhat is the worst case complexity of selection sort?
Select an option to see the answer and solution.