CORRECTION: at 42:50 heapify call for delete logic would be maxheapify(A, i-1,1) and in maxheapify method instead of while loop we can write if statement. :)

Discussed Heap sort and Heapify method to Create a Max Heap form Array. Step by step instructions showing how to run Heap Sort with its pseudocode.

DSA Full Course: https: [ Ссылка ]

******************************************
See Complete Playlists:
C Programming Course: [ Ссылка ]

C++ Programming: [ Ссылка ]

Python Full Course: [ Ссылка ]

Printing Pattern in C: [ Ссылка ]

DAA Course: [ Ссылка ]

Placement Series: [ Ссылка ]

Dynamic Programming: [ Ссылка ]

Operating Systems: //www.youtube.com/playlist?list=PLdo5W4Nhv31a5ucW_S1K3-x6ztBRD-PNa

DBMS: [ Ссылка ]
********************************************

Connect & Contact Me:

Facebook: [ Ссылка ]
Quora: [ Ссылка ]
Instagram: [ Ссылка ]

#heap #datastructures #jennyslectures

свернуть