This video explains a very important heap concept which is the heapsort algorithm using a dry run example. I have explained all the required concepts for doing heapsort given an array.First, we need to build a heap from the given array.We can build either a maxheap or a minheap.Once our heap is formed, we need to do EXTRACT MAX for N-1 elements if we have total N elements in our array.Extract Max internally makes use of HEAPIFY algorithm.If we are using a maxheap then we do MAX-HEAPIFY otherwise we use MIN-HEAPIFY.All the concepts are explained using a dry run example.The code implementation is also shown at the end of the video.

🧡 HELP us by donating on patreon: [ Ссылка ]
CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================
Join this channel to get access to perks:
[ Ссылка ]

INSTAGRAM : [ Ссылка ]

SUPPORT OUR WORK: [ Ссылка ]

LinkedIn: [ Ссылка ]

WEBSITE: [ Ссылка ]

TELEGRAM Channel LINK: [ Ссылка ]

TELEGRAM Group LINK: [ Ссылка ]
=======================================================================
USEFUL LINKS:
🟠Must do TIPS to ACE Virtual Interview: [ Ссылка ]
🟢Best strategy to excel your coding interview: [ Ссылка ]
🟡Get your dream job in 1 month: [ Ссылка ]
🔵How to crack dream job in just 2 months: [ Ссылка ]
🟣7 Days DSA plan: [ Ссылка ]


RELATED LINKS:
Power of Heap: [ Ссылка ]
Concepts of Heap: [ Ссылка ]
Representation of Heap: [ Ссылка ]
Heapify Algorithm: [ Ссылка ]
Build heap algorithm: [ Ссылка ]
Heap Algorithm: [ Ссылка ]


CODE LINK: [ Ссылка ]



#heap #heapplaylist #techdose

свернуть