with proper design, the features come cheaply. This approach is arduous, but continues to succeed. Dennis Ritchie
Heap sort is a comparison-based sorting algorithm and divides the input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region.
Heap sort is not stable sorting. A heap sort is especially efficient for data that is already stored in a binary tree. Heap sort does not take any extra space.
Write a program to implement heap sort.
Unsorted array before sorting: [12, 34, 56, 23, 45, 78, 99] Sorted array After Heap sorting: [12, 23, 34, 45, 56, 78, 99]