Skip to content
Related Articles

Related Articles

Algorithms | Sorting | Question 19
  • Last Updated : 20 Feb, 2013

Which of the following sorting algorithms has the lowest worst-case complexity?
(A) Merge Sort
(B) Bubble Sort
(C) Quick Sort
(D) Selection Sort


Answer: (A)

Explanation: Worst case complexities for the above sorting algorithms are as follows:
Merge Sort — nLogn
Bubble Sort — n^2
Quick Sort — n^2
Selection Sort — n^2

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :