Hash table quadratic probing

preview_player
Показать описание
Related Videos:

Data Structures Source Code:

Рекомендации по теме
Комментарии
Автор

Min 2:41, how do we end with that infinite loop using that that P(x) and H(k)=4? Shouldn't be like 6, 8, 5, 5

franciscoreismelo
Автор

I'm sorry but at 8:24, why did -6413 mod 16 come out to be 3? I didn't understand the working behind this. We aren't supposed to ignore the negative sign?

Nevermind got it :P

Luna-vkxy
Автор

So we have to check the key with the stored key for each clash right? That seems inefficient.

User-cvee
Автор

Is there any reason why, when you’re copying the contents of the first table into the new one, you don’t hash in the order that the elements were provided, but instead the order in the table itself. Would doing it the other way be wrong or cause an error in some way?

kingdominth