Heap Sort Algorithm EXPLAINED
#heapsort #dsa
Heapsort is a comparison based sorting technique based on a Binary Heap data structure.
Steps to follow --
1. Build a max heap from the input data.
2. The largest item is stored at the root of the heap. Replace it with the last item of the heap followed by reducing the size of the heap by 1. Finally, heapify the root of the tree.
3. Repeat step 2 while the size of the heap is greater than 1.
For more details refer to the following link
https://www.geeksforgeeks.org/heap-sort
On this page of the site you can watch the video online Heap Sort Algorithm EXPLAINED with a duration of hours minute second in good quality, which was uploaded by the user CodePhobia 16 December 2020, share the link with friends and acquaintances, this video has already been watched 771 times on youtube and it was liked by 11 viewers. Enjoy your viewing!
