Yeah I had the same thought but here is the thing. When u call the function remove() from an array you remove the least element of the array. So if you remove all the items from the array that he created in this video you would get a sorted array(that you could turned into a tree), in which every parent is bigger than its kids. I hope that helps clear things out.
In your example, the greatest value is already the root of your heap, in general however, its simply to fix the heap before swapping the 1st and last elements? Thank you!
You explain the sort but now how things are added in the tree. Then you choose an array that is pretty much sorted left to right. Its like teaching people how to bake a cake with the batter in the pan.
You had me at "What's gucci everyone"
Cringe, but good explanation!
i gotta agree
Hands down best heapsort video I've found in youtube
"Waz gucci everyone"
Thank you, this is a thorough explanation. Other videos are so much more confusing.
Great explanation. I never understood the sorting part of max heap until now.
Loved it sort and simple and precise.. Just also add how the heap was constructed in the first place.
thank you man that helped my conceptual understanding of this a lot
Very gucci explanation & animation
The best explanation I've ever seen!
the statement at 4:23 - Isn't a min heap sorting from least to max ? and max heap sorting max to min ?
Yes. Min heaps have the minimum in the root node or 0th index.
Yeah I had the same thought but here is the thing. When u call the function remove() from an array you remove the least element of the array. So if you remove all the items from the array that he created in this video you would get a sorted array(that you could turned into a tree), in which every parent is bigger than its kids.
I hope that helps clear things out.
Perfect! Thank you so much for putting so much time and effort into this!
best heapsort video
ever
This is a phenomenal explanation.
Thank you very much!
THANK YOU. I wish I could find videos like this for all of my CS topics.
Did denzel washington recorded this video?? xD
By the way great and short explanation of heapsort! Helped me a lot! Thank you!!
everything's gucci fam
THANK YOU! Finally some actually explaining it
LMFAO, "whats gucci everyone" that gave me a nice laugh :')
great video
Awesome video. Thanks loads!!! Learnt that up at once... :) Keep making such videos...
This is pretty gucci bruh.
In your example, the greatest value is already the root of your heap, in general however, its simply to fix the heap before swapping the 1st and last elements?
Thank you!
But how did the numbers end up in the right order for them to fit into the tree?
first half of the video : a bit slow but it's nice
the rest of the video : foken sonic
hey is it mandatory that in a max heap all the nodes will be in descending order if we write all their nodes in an array???
Isnt it easy when we go from bottom to up, by picking parent with child each time rather than rumble around all over the tree?
What’s heap sort used in?
what would have happend if you had 72 - 83 under 60(and under 72 the 85) instead of 85 - 83 under 60? woudn't it take 83 as heaviest element?
The heap will switch with the biggest element, of the children. So in your care 85 would switch to the top instead. I hope that clears things up.
What happens if from the beginning, the value of the root node is not the biggest one?
everyone dies
Hai Tran-Hong Then it's not a Maxheap, you'll have to make it a Maxheap first
thank you soo much my dear teacher .. much love
Thank you! I finally understand now.
Really clear explanation, thanks sooooooo much
It really bugged me to see the array splited, but great video.
This made me understand it! Thank you for this video
You had me at "What's Gucci everyone"!
life changing; 03:15 finally made sense!
Wtf whys ur tree is 85 on the left instead of on the right 85 is greater then 83
Great explanation!
IFrameRodger Thank you!
Very well explained!
Nice explanation
Great video dude, thanks
very good video. very helpful for me :) thank you!
You explain the sort but now how things are added in the tree. Then you choose an array that is pretty much sorted left to right. Its like teaching people how to bake a cake with the batter in the pan.
Thx mate it helped me a lot!!
great explanation!! Thank you :D
Thank you so much! I eventually got it! :)
great explanation!
Thanks, quick and easy!
Nice video!
Best explanation
Very Gucci of you, thank you sir
whats gucci everyone lol
Really helpful. Thank you!
lol whats gucci everyone
This video was english and great
Excellent.
Good stuff, thanks!
great video!!
you lost me at "whats gucci everyone"
Awesome LOVED it !!!!
Nc explanation. Thanks
100% pure gucci! :D
Tough to see how all this bullshit is efficient in any situation.
awesome :) thanks