why we are taking mod again with p ?, p = ( p * p ) % total size, we are taking mod in the int idx = find + ( key [j] * p ) % total size.
Not understand hash function
yes, I got it, but you can explain it with one example?
why we are taking mod again with p ?, p = ( p * p ) % total size, we are taking mod in the int idx = find + ( key [j] * p ) % total size.
yes, I got it, but you can explain it with one example?