Which of the following is a major difference between Merge Sort and Quick Sort?

Options

  • A. Merge Sort guarantees O(n log n) worst-case time in its standard form
  • B. Quick Sort always requires O(n) extra array space
  • C. Merge Sort does not use recursion
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. Merge Sort guarantees O(n log n) worst-case time in its standard form

Detailed Explanation

A major difference is that standard Merge Sort guarantees O(n log n) worst-case time, whereas the basic Quick Sort algorithm can have an O(n^2) worst case when poor pivots repeatedly create highly unbalanced partitions. Merge Sort generally requires O(n) auxiliary space for arrays, while Quick Sort can be implemented with relatively small additional space apart from its recursion stack. Both algorithms commonly use recursion and follow Divide and Conquer.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts