Wrap around is not correct.

[karim-manaouil]

The implementation of Hopscotch lacks a technique to make a wrap around, the current algorithm is not correct in such a case. First, there should be a certain condition to check if Bucket[j] is in neighborhood of Bucket[i] when j < i (For instance bucket[0] is in neighborhood of Bucket[MapSize - 1]).

I've written an implementation in C that has a wrap around functionality. You can check it out at :https://github.com/karim-manaouil/Hashmaps