Great explanation, but I am confused at 5:10, I thought we were using the remainder plus the next squared index? So 14 would have been (0 + 1^2) % 7 = 1 which is taken, then (0 + 2^2) % 7 = 4 which is taken, then (0 + 3^3) % 7 which is 2, so we got an empty spot. I think in the tutorials I have seen so far they do it this way, but can you do it either way, or am I wrong about this? Thanks
You crushed it with this explanation! Thank you so much.
Thanks very much, u r methods were very help full to me 👍👍
Thank u very much . ur presentation is more helpful.
Appreciate the clear example for the refresher!
Finally a good explanation, thanks a lot for that
its helpful
Tysm!💕
Wow Great.
thanks so much really helped :D
Great explanation, but I am confused at 5:10, I thought we were using the remainder plus the next squared index? So 14 would have been (0 + 1^2) % 7 = 1 which is taken, then (0 + 2^2) % 7 = 4 which is taken, then (0 + 3^3) % 7 which is 2, so we got an empty spot. I think in the tutorials I have seen so far they do it this way, but can you do it either way, or am I wrong about this? Thanks
Thank you soon much!!!!!
How do we know when to stop the quadratic probing. You missed the important part.
It wasn't missed. 2:48 and 4:50 (for as long as you need it). When you find a valid position for the data you are inserting, then stop hashing.
in case of inserting 14 15mod7 was 8 you have taken it as 1
15 mod 7 is 1 not 8
use % for mod