• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Top MCQs on Sorting Algorithms with Answers

Question 1

What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?
  • Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)
  • Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)
  • Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(nLogn)
  • Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(nLogn)

Question 2

Suppose we have an O(n) time algorithm that finds the median of an unsorted array. Now consider a QuickSort implementation where we first find the median using the above algorithm, then use the median as a pivot. What will be the worst-case time complexity of this modified QuickSort?

  • O(n^2 Logn)

  • O(n^2)

  • O(n Logn Logn)

  • O(nLogn)

Question 3

Which of the following is not a stable sorting algorithm in its typical implementation.

  • Insertion Sort

  • Merge Sort

  • Quick Sort

  • Bubble Sort

Question 4

Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).

  • Quick Sort

  • Heap Sort

  • Merge Sort

  • Insertion Sort

Question 5

Given an unsorted array. The array has this property that every element in the array is at most k distance from its position in a sorted array where k is a positive integer smaller than the size of an array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?

  • Insertion Sort with time complexity O(kn)

  • Heap Sort with time complexity O(nLogk)

  • Quick Sort with time complexity O(kLogk)

  • Merge Sort with time complexity O(kLogk)

Question 6

Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:
2  5  1  7  9  12  11  10 

Which statement is correct?
  • The pivot could be either the 7 or the 9.
  • The pivot could be the 7, but it is not the 9
  • The pivot is not the 7, but it could be the 9
  • Neither the 7 nor the 9 is the pivot.

Question 7

Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?

  • 1

  • 2

  • 3 or 4

  • 5 or 6

Question 8

What is the best time complexity of bubble sort(optimised)?

  • N^2

  • NlogN

  • N

  • N(logN)^2

Question 9

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?
  • Heap sort
  • Merge sort
  • Quick sort
  • Insertion sort

Question 10

What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search?

  • N

  • N*log(N)

  • N2

  • N*log(N)2

There are 61 questions to complete.

Last Updated :
Take a part in the ongoing discussion