Which of the sorting algorithm has the worst case time complexity of n log n ?

Explanation

Heap sort is O(n log n) in the worst case; quick sort is O(n^2), insertion and selection sort are O(n^2).