Видео

Thank you very much! now I understood

thanku bro ,this helped me out today after 11 years. handsoff

Love the way you explained the BFS, but is there a way to write the code using recursion?

Bro I watched so many videos on how to do this and still could not figure it out. Not sure what yours did differently, but I'm not gonna overthink it, thank you man!!

I'm self studying and teaching computer science (career change) and your videos are a great resources to help solidify and visualize concepts, thank you!

Great video keep it up

thankyou for saving 20+ mins

What through me off for a bit is i, j, k starting at 1 is because the graph/vertices start at 1. if you're using indices or the lowest node is 0 or another number, then it needs to start at a different number.

I am ashamed to learn that I am 8 years behind learning these algorithms although having 14 years in the industry.

W Michael

overly complex data structure, feels like it's only useful theoretically...

shokran

omg that's crystal clear

Pivot is reference. You just got to put all the values that is larger than the pivot to the right and values smaller than the pivot to the left. Thats all it is. Why are the comments overreacting??

This is great for revision

u r singlehandedly making algorithms easy for people keep it upppppp

Oh this makes it so much easier i was watching the visualisation but i just get confused lol since i am not very perceptive thank you this helps a lot

thanks man

I'm so happy 30% was passing in my DSA course...

i hope this comes clutch for me learning it from scratch for a semester exam tomorrow.

In your head don't move the pivot to the end and think of it more like one big tree.

This man is a savior

Excellent explanation!!!

scheiss Video

how can i call fixup for deleted node???

Good shit

if j = i + 1, shouldn't the current item j of the inner loop, which indicates the blue arow in the video, starts one behind the red arow during each iteration instead of showing up together under the same number?

MY man 🙌 you have been coming in clutch for years

I'm coming for the delete-mixup haha

YOU SEXY MAN

Without delay, you need to open this email immediately.

such calm voice! Love it

I think this might be one of the best explanations I've seen, I just couldn't understand why we'd need to perform more than 1 iteration. But it makes sense because we don't know how to learn the node, hence, the requirement for more edges. We may finish early, but we need to discover all the possible shortest paths before that.

It is not clear to me why time complexity of rotations (when fixing violation) is of constant time. Don't we insert nodes again, during rotations so it's O(log n)? Otherwise it's a great video, thank you so much.

Thanks for this, Better than a 2 uni lecture!!

This is a good explanation, but it is for a tree not a graph. I don't think the arithmetic version would work for a graph since there is no real root. You would have to use recursion for a true graph

what does the k represent?

Bro Tamil la sollunga

lol 3 hours of lecture and you explain in 4mins

"Worst case scenario" - not that obvious part without context

The sound here is scary, almost had a panic attack.

Why not use bsearch within a node?

Thank you for these videos, I'm currently studying for algorithms & data structures exam and you are very clear in explaining how these algorithms work!

Hey there, I have some great news that you'll be thrilled to hear!

Stay positive and let that smile light your way.

3:28 I think the second one is not a min-heap. Min-heap is complete binary tree.

After 1 hour videos, I cannot believe how much this helped me finally understand this topic. I'm in awe.

only love for you

great tutorial

Extremely helpful!! Thank you !! :)