# Heap sort Complexity

Heap sort Complexity. Time complexity shows growth in time requirement, but not exact time. Time complexity to sort element in heap is O(nlogn). To understand, that how this figures are made for this complexity, let us have a look on some complexity for inserting and deleting in heap. You can also refer Heap sort : How Heap sort is implemented. … Continue reading Heap sort Complexity