News for hackers. Stuff that matters.
Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by dryman on Tuesday May 09, 2017 @01:26AM (#14297925)
When I first see "sorted array", my first impression is it is sorted by the "original key". If we look for the hashed value in hash table, all hash tables are "sorted array" with this definition.

Also there's a finial mod in linear probing h(k, i) = (k + i) mod N. With this mod you may have different key/probe combination that messed up the order.

There are no comments on this comment yet.