7.9 Heap Sort | Heapify Method | Build Max Heap Algorithm | Sorting Algorithms

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:    • Data Structures and Algorithms  

******************************************
See Complete Playlists:
C Programming Course:    • Programming in C  

C++ Programming:    • C++ Complete Course  

Python Full Course:    • Python - Basic to Advance  

Printing Pattern in C:    • Printing Pattern Programs in C  

DAA Course:    • Design and Analysis of Algorithms(DAA)  

Placement Series:    • Placements Series  

Dynamic Programming:    • Dynamic Programming  

Operating Systems: //   • Operating Systems  

DBMS:    • DBMS (Database Management System)  
********************************************

Connect & Contact Me:

Facebook:   / jennys-lectures-csit-netjrf-316814368950701  
Quora: https://www.quora.com/profile/Jayanti...
Instagram:   / jayantikhatrilamba  

#heap #datastructures #jennyslectures