What is the time complexity of heap sort?

O (nlogn)

Explanation:

Heap sort is a sorting algorithm which makes use of the heap data structure. An array consisting of n elements is first transformed into a heap (O (log n)) and the lowest element is extracted from this heap with restoration of the heap property (O (n)). So the overall time complexity of the entire operation is O (nlogn). For example it the input consists of 10 elements, the time complexity will be O (10log10).