Which of the following sorting algorithms has a worst-case time complexity of O(n log n)?

Explanation

Merge sort always divides the list into halves and merges in linear time, so its worst case is O(n log n); quick sort degrades to O(n²).