What is the worst-case time complexity of the heap sort algorithm?

The worst-case time complexity of the heap sort algorithm is O(n log n), where n is the number of elements in the input array.