What is the best case time complexity of heapsort?

The best case time complexity of heapsort is O(n log n), where n is the number of elements in the input array.