Algorithms | Sorting | Question 19

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(n²)
• Quick Sort: O(n²)
• Selection Sort: O(n²)

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

My Personal Notes arrow_drop_up

Save