Algorithms | Sorting | Question 19
Which of the following sorting algorithms has the lowest worst-case complexity?
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
My Personal Notes arrow_drop_up
Please Login to comment...