Same, the PDF file we are given as learning material doesn't explain very well about three methods to find the next empty table slots, for this algorithm it doesn't even have details about the hash function: hash(k) = k + j^2 mod table_size. I feel like university just overcomplicate things lol. I learn more by watching TH-cam and understand all the concept much faster too.
Finally -- someone that does the math. Thank you so much!! My professor kept circling around this and didn't give us this clear of an explanation -- You're a hero of epic proportions, sir!
I'd been struggling with this for DAYZZZZZ!!! Watching this video helped me to get it sorted in my brain and on paper so that I could complete my school assignment in under an hour. GREAT VIDEO TUTORIAL!!! 😘
Excellent video, as usual, but if you are a student then please make sure that this is the correct hashing method that your class is teaching. My course content was confusing so I came here looking for help, and it helped a lot, but unfortunately I didn't realize that this is a very different hashing method and I got all those problems wrong (even though I did them right based on this video). So just be certain that the hash function you use actually matches what you are learning. This one uses the key value instead of the index. My school wanted the index instead of the key. Live and learn I guess.
Nice job. The only criticism I have would be this: Maps consist of keys and values. In your case, the keys are the indices of the map. The values would be the numbers that you are inserting.
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!
Hey man, no problem thanks for watching and the very positive comment. Comments like these that let me know my videos are helping others keep me going, so thank you brother.
all fine and good but still haven't found anyone explain how to retrieve them. do you just start back at counter 0 and increment up j until you hit your index?
can you tell me how you calculated it i think you are using the old conservative forumla which was discontinued in 2016 december 21 as of the new government Math Act.
I don't think you understand modulo. It's not just how many times does 7 go into 20 evenly, it's the remainder after it's gone into it as many times as possible: 7*2 is 14 and then the remainder is 6 which gets you to 20
Best explaination I found after wasting hours on TH-cam! Thanks man.
Thanks Cap!
This was one of the best explanations of a CS concept I have found. Simple, straightforward. Thank you very much!
This is relatively easy. But my professor made this seem like a extremely complex stuff.
Thanks for the clean explanation.
This is what academia does - take your money and make you feel dumb 🤣
@@thekevinwang it's a public school. One of the best in Europe for CS / software dev
Same, the PDF file we are given as learning material doesn't explain very well about three methods to find the next empty table slots, for this algorithm it doesn't even have details about the hash function: hash(k) = k + j^2 mod table_size.
I feel like university just overcomplicate things lol. I learn more by watching TH-cam and understand all the concept much faster too.
You're getting me through my Data Structures class 7 years later, you're amazing ty man
Really most of the world's students benefited from your explanation, thank you very much
Thank you for the kind comment! I truly appreciate it!
This is such a good explanation, a lot of the larger channels aren't this good! Thank you!!
Finally -- someone that does the math.
Thank you so much!!
My professor kept circling around this and didn't give us this clear of an explanation -- You're a hero of epic proportions, sir!
Thank you!
I'd been struggling with this for DAYZZZZZ!!! Watching this video helped me to get it sorted in my brain and on paper so that I could complete my school assignment in under an hour. GREAT VIDEO TUTORIAL!!! 😘
Thanks Dearick, I appreciate that !
This is the best explanation i have ever seen Thank You brother!
So helpful! We're doing pseudocode in my class (I'm IT, not CS) so the way you have it written out also is really helpful
Thank you!
I wish the book could have explained this concept the way you did so simple and straight forward thanks dude
Finally a topic from class with somebody I can understand. Good video man!
Thank you !
Thank you for your great service to students everywhere.
Thanks!
Quite possible the best video on explaining a concept that i've seen. Thank you!
This saved me reading the textbook for an hour. Thank you!
You're welcome!
awsome bro ... I dnt know why people have to make things complex .. this is the BEST !!
Another great refresher. Perfectly explained. Just earned a subscriber.
Thanks for subscribing!
Thanks for the explanation, my right ear loved it
thank you, you made me remember how easy and simple solving this, internet made it too complex
Thank you for your video! Your explanation helps me a lot. So lucky that I find your channel. Already subscribed!
Thanks so much man. This will really help with my finals.
That's great to hear, thanks for watching!
The best lecture on probing.
I have an exam on this tomorrow so thank you from Ireland for explaining this! :)
I'm glad my videos are helping others internationally. Thanks for the comment TheDARA7!
Brother you nailed it!!.
Very well explained!!
Didn't enjoy it watching right before the exam. But did like it :D Ty
Good job mate
Super simple to understand, just subscribed 👍🏿
Thanks!
Man these videos are amazing.
Thanks Jakob!
Excellent video, as usual, but if you are a student then please make sure that this is the correct hashing method that your class is teaching. My course content was confusing so I came here looking for help, and it helped a lot, but unfortunately I didn't realize that this is a very different hashing method and I got all those problems wrong (even though I did them right based on this video). So just be certain that the hash function you use actually matches what you are learning. This one uses the key value instead of the index. My school wanted the index instead of the key. Live and learn I guess.
I enjoyed it man, coz it's hell clear. Subscribed already.
Thanks for subscribing Gepli PLR !
Simply Clear and Brilliant
Best video which I found till date.. thank you sir :)
Thank you man, very clear explanation
thank you from the US Virgin Islands
thank you, sir, you explained it very well
Nice explanation mister. Thank you
Wow you made that sound so easy, excellent video thanks so much.
Nice job. The only criticism I have would be this: Maps consist of keys and values. In your case, the keys are the indices of the map. The values would be the numbers that you are inserting.
Best explanation ever!
Well explained. Thanks man
Thank you Bijay !
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!
You ARE the BEST ! THANK YOU SO MUCH BROTHER
Hey man, no problem thanks for watching and the very positive comment. Comments like these that let me know my videos are helping others keep me going, so thank you brother.
Helped me a lot, thank you!
Sehr gutes Video! Explained very well and simple! Thank you sir! :)
why may it not be possible to enter a new
key into the hash table even though it is not yet full. Could you explain?
what if the size is not given? should we take any size of the array?
Thanks man!
super helpful!! thank you!
Thanks for watching!
Great video!
Thanks ! Glad you enjoyed it!
Thank you, great explanation
thank you very much sir! greetings from indonesia
Fantastic explanation. Thanks man!
Thanks for watching!
So how do we deal with infinite looping
Got it.. Nice explanation
Good to hear !
Nice explanation brother.
Thank you very much !
all fine and good but still haven't found anyone explain how to retrieve them. do you just start back at counter 0 and increment up j until you hit your index?
oh and what do you do if you delete an item at j=0? do you shift everything down j-1?
You just mark a deleted cell. stackoverflow.com/questions/27215704/double-hashing-remove-and-rehash-function
Thanks bruh
You helped me code it without problems!
maybe im missing something but why is 76 6? did you times divide? how did you insert into 6
you helped me a lot, thank you very very much :)
Glad my videos were helpful!
Thanks a lot mate! Very good explanation. Just to double check, the total numbe rof collisions in that example would be 5 right?
awesome explanation...Thanks
ily. thank you for the videos lol
THANK YOU THANK YOU THANK YOUUUUUU!!!!!!
Thank you for watching Nora :]
Good video, very helpful!
Thank you !
I love you for dis
Thank you !
thanks!
so do you reset the counter j for every key you're inserting?
yes
Thanks!!
You are welcome !
THANK YOU
Thanks for watching!
thank you so much
i really love you...you re the best...
THANK YOU !
ThankYou so much .!! so well explained !! :-)
Bro... thank you
well done ! just like the ways i like my Steaks :)
Haha very funny ! Thanks for watching !
Obrigada! (Brasil)
bem vinda!
Subscribed you channel
Thank you!
Nice tutorial! But why is 5 mod 7 = 6? would have worked out for presentation purpose with 6 as fourth number!
I got the idea tho. Thanks buddy
5 mod 7 = 5 in the video, but (5 + 1^2) mod 7 = 6, maybe you misread?
cool
At first I tought you were just another Indian and I was afraid that 99% of the video I wouldn't understand.
I'm just gonna apply to McDonalds
20 mod 7 was not 6!!!! Your "Math" was in fact wrong!!! It is actually 2.
Please recheck your math, 20 mod 7 is 6. My "math" was in fact correct.
can you tell me how you calculated it i think you are using the old conservative forumla which was discontinued in 2016 december 21 as of the new government Math Act.
I don't think you understand modulo. It's not just how many times does 7 go into 20 evenly, it's the remainder after it's gone into it as many times as possible: 7*2 is 14 and then the remainder is 6 which gets you to 20
Devin Johns nice . Thanks for the info!!!!!!!
THANK YOU