Which of the following sorting algorithms has the lowest worse-case complexity?
Merge sort
Bubble sort
Quick sort
Selection sort
Correct Option: A
Irrespective of the input, merge sort always have a time complexity of $\Theta(n \log n)$.
64.3k questions
77.9k answers
243k comments
79.6k users