Відео

ur so gooood!!!!!!

thanks man

thx broski

Thanks for the explanation. I was confused in this 🎉

thanks for this man i have a data structure exam tomorrow and you made this sound like literral childs play, you are the boss

This is phenomonel, thank you! Couldn't have asked for a better explaination.

there wasnt a single video on this thank u

Thank you for the well made content!

Magician🧙‍♂

Best one ❤❤

i think C3 equals ((n^2+n)/2) + n, and C4 equals (n^2+n)/2

came here to find an exercise on how to calculate balance factor, my answers match yours so thank you for this video!

i have my exam in 3 hours and this is gonna come really handy

Wow thank you sooo mucchh 😭😭 Btw, just a question, will it be much better to use the 2(k-1+k-2+...+1) Than k(k-1) I tried guessing the pattern myself and my simpleton brain got T(n) = T(n-k) + k(2n) - (k(k-1)) instead, now I'm wondering if using the summation would be better?

randerson112358 da goat

Randerson da goat

Thank you!!! I was so confused by looking at the PowerPoint my professor uploaded and you made it make sense.

Great video but man were you giving me motion sickness

I love u like actually thank u so much

AI and professors could never teach this in 2 minutes I swear. Always making it so complicated.

Its series sum formula, sum from i=1 to n = n(i + n)/2

why tf do I have to learn this in a 12th grade basic informatics class

Thanks!!

thank you

isnt this case 1

thank u king, this video saved me 🔥🔥🔥

if you define the a function f’(n) where f’(n) is the inverse of function f(n) you can subtract T(n-1) and then divide by 1 you will get f’(n) = O(n) if you take the anti derivative of this result you get f(n) = O(n^2)

This is awesome!! Thank you my friend.

This may just be a lost comment on this old video, but it was super helpful! One question though. If you run into a collision, do the quadratic probing method, and get stuck in an infinite loop of collisions, is there a specific way to handle that such as just forgetting it and moving on? or should it just stop right there? Thank you again for the amazing video!

Great Work Clear Explanation... ❤

I've been struggling to understand what values to make n and the constant. Nice to see a clear demonstration on why you arrived at n = 4 for the proof unlike many other resources I've looked at.

I luv you

thank you so much

Awesome!!!

Thanks, my uni wants me to solve these using this method so im glad you made a video about it 😊

What is time complexity of this operation?

Best explanation on this. thank you.

Beautifully explained!! Thank u so so much. Never understood this til now🎉

you should be teaching at an university

Can this technique be used for max heap such that we swap max element for every element that is greater than root?

FINALLY, someone who is ACTUALLY making sense! thank you senpai 😘

Thank you for this! You're example is really good and not that easy! ☺️ Which is what I wanted! Good to know how to solve something difficult XD

your description of case 3 converts c into k halfway through i think. ('a*f(n/b) <= k*f(n) where k < 1' should be c not k

This is really helpful video thanks Rand!

thank you! you are the GOAT

Why is it called O(n^2) instead of Teta(n^2)? The only part i didn't understand.

how do we know the index of 4 to heapify_up

ofc you deserve our subscriptions. thanks

Nn

Good explanation