Open In App

Algorithms | Sorting | Question 19

Like Article
Like
Save
Share
Report

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: O(n*log(n))
  • Bubble Sort: O(n2)
  • Quick Sort: O(n2)
  • Selection Sort: O(n2)


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads