What is the time complexity of heap sort algorithm?

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