Vidyalelo
Data Structure · all questions

Sorting Algorithms
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

509

Questions

25/26

Page

Pick an option on a question to see the right answer and solution.

What is the auxiliary space complexity of strand sort?

Select an option to see the answer and solution.

What is the average case complexity of QuickSort?

Select an option to see the answer and solution.

How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?

Select an option to see the answer and solution.

Cube sort is a comparison based sort.

Select an option to see the answer and solution.

The given array is arr = {1, 2, 3, 4, 5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are . . . . . . . .

Select an option to see the answer and solution.

Which of the following sorting algorithm is worst in terms of time complexity?

Select an option to see the answer and solution.

What is the best case complexity of selection sort?

Select an option to see the answer and solution.

Strand sort is a comparison based sorting algorithm.

Select an option to see the answer and solution.

Bubble sort is also known as . . . . . . . .

Select an option to see the answer and solution.

Which of the following non-comparison sort can also be considered as a comparison based sort?

Select an option to see the answer and solution.

What is the auxiliary space complexity of tree sort?

Select an option to see the answer and solution.

What is the best case time complexity of cycle sort?

Select an option to see the answer and solution.

Which of the following algorithm is best suited for the case where swap operation is expensive?

Select an option to see the answer and solution.

What is the space complexity of pigeonhole sort (k=range of input)?

Select an option to see the answer and solution.

Bottom up merge sort is a stable sort.

Select an option to see the answer and solution.

Which of the following sorting algorithm is NOT stable?

Select an option to see the answer and solution.

What is the average case time complexity of odd-even sort?

Select an option to see the answer and solution.

Which of the following sorting algorithm does not use recursion?

Select an option to see the answer and solution.

Which of the following is a variation of bubble sort?

Select an option to see the answer and solution.

The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

Select an option to see the answer and solution.