Answer:
The answer to this question is O(NlogN).
Explanation:
The time complexity of Heap Sort on an array A is O(NLogN) even if the array is already sorted in increasing order.Since the Heap Sort is implemented by creating the heap from the array and then heapifying and then repeatedly swapping first and last element and deleting the last element.The process will be done for the whole array.So the running time complexity is O(NLogN).
