Fibonacci heaps in 8 minutes - Extract Min

[@badnotgoood]

Stop searching. This channel is the one

[@_soundwave_]

Straight to the point. I dont know why there arent more views. I wonder how much more detailed it would be if you had support.

[@MichaelSambol]

All good, thanks for watching!

[@marcovalla4805]

Thank you so much, it really comes in handy for my algorithm course. I'll be waiting for extract min amortized cost video

[@zhiyizhu3040]

I am looking forward to cost video too

[@rudrakpatra6579]

This is pure gold.

[@marcinlinkiewicz2058]

Perfect timing, just as I was learning Fibonacci heaps, huge thanks for the video

[@elieishak5267]

Awesome vids man. Please make a video about the amortized cost.

[@MichaelSambol]

Thanks man! Check these: kzbin.info/aero/PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv

[@elieishak5267]

@@MichaelSambol Thanks g I owe you my cs degree

[@adambenes8581]

How did you in methon consolidate find out that the number of elements in A must be 2 times logarithm if I would have heap with two elements that has height of 5 i would be screwed wouldn't I be?

[@megamindsfacerazor1987]

how would you have a heap of two elements but a height of five? that makes no sense lol

[@abdulsamadh6318]

When you try to teach abstract concepts you should probably show how the operations work first to help people visualize before jumping to the code directly.

[@mohsenmaj5262]

legend 🤩

[@unity4arabic948]

It take 8 minutes to extract min !!! So slow operating

[@MichaelSambol]

2x the speed :)

[@unity4arabic948]

@@MichaelSambol It was a joke 🤣 I meant extract min should be O(log(n))

[@YLLIEEGD]

@@unity4arabic948 ha ha ha ha ha ha ah