Heap sort is a sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. Heap is balanced, left-justified binary tree in which no node has a value greater than the value in its parent. So the heap sort algorithm must work on reverse order.

In case of heap sort, a large area of memory from which the programmer can allocate blocks as needed, and deallocate them when no longer needed.

Click here for Heap Sort in C

## Comments

## Post a Comment