Heaps, heapsort, and priority queues - Inside code

NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent

[insidecode]

🔴
/ \
🔵—🔴
| |
🔴—🔵

[varunalur]

This is hands down the best explanation of heaps. You're a very talented person, thanks so much for your efforts.
You did in 19 minutes what my professor is incapable of doing in 3 hours.

[jojee]

The use of a power series at 13:20 to find the time complexity blew my mind. I never thought about how time complexities are actually proved.

[josiahdavid]

Watching the heapsort at 15:25 was so fun! This is a great video. With excellent explanations and visuals, Great Job!

[MoscleBrog]

Animated example in algorithm. YES PLEASE.


This is the best explaination with showing the flow of the program. TY Inside Code

[msinkusmeowmeow]

Awesome explanation!
Keep up the good work, continue improving and one day your channel will be huge!

[Sapphiamur]

Best explanation, seriously, all the graphics were so helpful! Thank you so much!

[someoneunknown]

Never knew about the heaps . Again thanks for increasing my knowledge 😍😍🥰✌️

[BlaBlaBlaInDaHouse]

This is definitively the best video on heaps! Thank you for your effort

[stasdurka]

Great video. I appreciate the work you put in these videos and the fact that you explain the concept very well (it takes real understanding to be able to teach something like this, unlike many channels out there wasting the viewer's time going through some example step by step on a whiteboard). Had to review some old stuff from uni and I'm so glad I found your channel :)

[akshaygoel]

The animations are incredible! I'm amazed at the detail

[rongitmukherjee]

Wish I had watched this video in college when it was in my syllabus. Better late than never, great explanation, better than others.

[elyababakova]

Very nice summary and illustrations of heap!

[ElevateCode]

The animations are super helpful, great job and thank you for such a good explanation!

[dominiquekostler]

I believe there's a minor mistake in the explination here 2:50. Shouldn't we be talking the floor of (i-1)/2 ? Since if we are for example at index 7 then only doing (7-2)/2 = 2.5. And there can't be a 2.5 index position in an array.

[MateoAcosta-zius]

Incredible way of teaching. Little step by step, beautiful and organized illustrations. Thank you very much :D!

[edilgin]

Isn't heapsort supposed to have O(1) space complexity? In your code you create a seperate array that holds the sorted data which would make it O(n). In the implementations that I saw they use the same heap array for sorting as well. Any help is welcome :)

[HyperFocusMarshmallow]

10:21 It makes sense that for constructing the heap, sift up (I hope I’m correctly recalling which one is which) is better than sift down and that starting from the bottom is beneficial.

Is this the best one can do? If so do you know of a good resource for the proof?
I might try to figure it out in my own, but it’s at least nice to know whether I’m trying to prove or disprove it.

[SorestCode]

i want to ask how did you do the graphic effects and all stuff in the video which tools did you use? thanks!

[chandrashekharmuradnar]

Very good stuff, thanks for the compiling this video.