Which of the following sorting algorithms has the lowest worse-case complexity?
Merge sort
Bubble sort
Quick sort
Selection sort
A.
Irrespective of the input, merge sort always have a time complexity of $\Theta(n \log n)$.
Gatecse