Please include a summary of the program i.e what problem it solves.
Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element and place the maximum element at the end. We repeat the same process for the remaining elements.
Checklist:
[ ] My code follows the style guidelines of this project
[ ] I have added my code in its respective language folder.
[ ] I have mentioned a short description about the code at the beginning of the program.
[ ] I have performed a self-review of my own code.
[ ] I have commented my code, particularly in hard-to-understand areas.
[ ] My changes generate no new warnings.
[ ] I have not deleted any files that already exist in the repository.
Description
Please include a summary of the program i.e what problem it solves. Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element and place the maximum element at the end. We repeat the same process for the remaining elements.
Checklist: