The background music is a little distracting... Could've done with lower volume or a slower-paced music :/

Thanks a lot！！！ Usually our teacher teach us fibonacci heap but we do not know why?Your video really easy to know.

This was a very convenient video to come up. Thanks!

Impressive ! I have almost inderstood everything

I missed the part of linked lists importance.

Wow I'm so bless to start the weekend watching this video, Probably made my weekend. Amazing explanation and demonstrations, Much appreciated.

Sir, you are a god, so well explained, thank you very much sir.

25:52 that's SO clever. Like really. Thank you for this video. it was truly enlightening

What really makes me sick is run times O(n!) and, worst of all, O(n^n)... Great video, also. :)

How do I contribute to the growth of your channel?

Nice video, exactly what i was looking for. Everyone shows how it works, but not why it works

this was amazing, and so helpful, thank you so much!

27:35 THIS MEANS FIBONACCI HEAPS ARE A JOJO'S REFERENCEEE!? 🏇🏇🏇

where is the code!

great video, even better music choice

The main thing that came to mind when explaining why the FIbonacci Heap isn't more commonly used was entirely the amortized complexity thing - if you're running a server, life is great until your clients start doing a bunch of debt-accruing actions (inserts, decreases) and then calling extract min. Whoever called extract min won't be happy. It's great in a world where you're only crunching numbers and waiting for a single final result after a lot of heap operations (which is why people listed a lot of scientific applications), but most of the computation in a normal day is business logic, which serve lots of individual requests, and therefore much prefer consistency over raw speed.

Babe wake up, the best data structure yt channel first reel just dropped

very beautiful thank you

Ever since I first learned of red-black trees, I've been interested in the various ways trees can be used/maintained to keep data organized. This is an interesting approach.

Next Leonardo heaps?

Great video, convinced me to sub.

Great video, thank you very much❤

That was a rollercoaster. I couldn't repeat back any of that but that really helped to clear it up.

so sad that this channel has not posted anything since last year. such a high quality content, i wish i could see more from this channel. I hope the admin is fine

I was struggling to understand this concept and you saved me! Tons of thanks

This data structure is my absolute favorite, and has been for years. Second place to Red Black Trees or Circular arrays (vectors). I remember when I first saw the algorithm for how trees are merged, I exclaimed that it's absolutely genius how it works.

ooh, so fibonacci heaps are one of those glacial algorithms that I've always heard about, where n must be MASSIVE before it starts outperforming other algorithms with worse big O time complexity but better time complexity on average in all real life use cases.

Do I have permission to use your animations for my research?

This is such an amazing Video, thank you very much!

Where are you? We need more videos 😢

Gorgeous video and amazing production and explanation. Congrats!

Hey! Just wanna tell you! You are way much better than our professor speaking 3hours but still got me confusing!!!!!!!!! You literally killed it !!!

This is an incredibly intuitive way to explain these concepts, great video!

gem :) or an entire fkin treasure ,,,,how can someone be soo clear and precise with their approach of explanation

Very nice video! Good explanation and no over-the-top animations. But... Why the background music? I like Bach and have the Golberg Variations on CD (Glenn Gould) Why not start the video with a recommendation of background music and leave it to the viewer to start a CD or Spotify? My mind keeps switching between listening to the music and the narration. And is not that the background music makes it difficult to follow the narration.

Great explanation; I'll need to rewatch it again several times to really understand it. Superb Work 👍👍🙏🙏

Why does the animation look similar to 3b1b?

Now that is what i want from a teacher. Explaining the why instead of just going with the how and what.

Fascinating! I like the controlled laziness approach. What other cool but unusual fatties should I know about?

There's a balance between performance and memory size, you can't optimize both. Faster algorithm is general means using more memory.

nice video! Thanks for making it

This is great!

This is the best made, most clear video on the topic I have ever seen. Amazing!

08:26 On what rule we sort the nodes in those subtrees? for example we can put all nodes of the second tree in the first one in some kind of ascending order according to original node of the first tree, so if we can why we separate those nodes in another tree?!

I like unbalanced binary trees where each node is the minimum of its right subtree (no constraints on the left subtree). Very easy to implement using list sorting, constant insert, constant delete, constant merge and amortized log min

I miss you, I wish you make more videos when you have the time , literally the most elegant algo channel (even with so low number of videos)

Anyone else notice the prime number pattern?

Um only issue I have is brain explosion wtf

Phenomenal explanation

could you do a video on Fenwick Tree aka the BIT?