Heap Sorting ,Create Heap ALGORITHM , Heapify Method

Given an array , create a heap and apply Heap sort algorithm to sort the array.

[kovalski]

The best teacher for algorithms on the internet! I can't wait for more videos!

[himanshu]

it was literally that awesome that I had watched a complete ad just for a small contribution from my side. Thanks.

[conintava]

I absolutely love this tutorial. I really appreciate your step by step technique. There were a lot of things that were cleared up from other tutorials which I could not understand. You filled all those gaps for me. Thanks a lot!!

[ushadeepak]

I have to say “Your Tutorials are the BEST”.Thank you so much for providing your github link reference too.

[davoroe]

Brushing up on sorts, I looked at 4 videos on heap sort that were utterly confusing before yours. Well done. What other "teachers" don't realize is it's great to begin at the beginning and show even the in-between steps. Way to follow through.

[nidhiraj]

Awesome before watching your sort was one of the toughest topic for me but now I feel so satisfied.... It's all because of you sir.... thanks a lots for uploading this video

[SaumyaSharma]

Thanks a million Sir 🌟🙏👍...
Very powerful Explanation 🙌

[alishashaik]

Sir ur teaching is very impressive 👌
U explained it in a simple and easy way.

[sibipatel]

sir ! the way you explain each and every step in a simple way its really awesome thanks a lot sir....

[cookiemonster]

very clear explanation of the concept of heap and heapify operation along with mapping of an array elements to the elements of a binary tree, exactly what I was looking for.

[bikashkalita]

Thank you for the lecture. Really helped me clear my doubt regarding heapify method.

[shashanksaxena]

thank you for explaining in such a easy way....
your tutorials are very easy to understand...

[Beast_theGymRat]

Heap sort completed Thanks alot guruji

[nagalakshmi]

Thank you so much sir,
You explained very clearly.
I understand it very well.
Once again thank u sir.

[arugollu]

Thanks. You have explained steps very clearly. I understood it better.

[roopeshmanchanbele]

Very simple and easily made understood you just saved my exam :D :D

[rehanmahmud]

@Vivekanand Khyade - Algorithm Every Day
For heapifying after we retrieve 6, shouldn't our last element be from index 0, 1, 2, 3..
I see you took 9 but 10 is the last element in our tree ?

will you please explain about this?

[AgarwalAnup]

Lovely explanation
keep up the great work
Thank you

[karankumarm]

your tech method is always good .thanks bro's

[ddrivegames]

I love you dear sir g i from pakistan me and my frnd understand your lecture so helpfully good luck