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