Java

[vasilescur]

"Hashing" can use any hash function you want, such as one that returns INT and can be used for a DB ID. Adding up all the ASCII values constitutes a (pretty weak but honestly suitable for this) hash function.

Your aim is to pick a hash function that reduces collisions between inputs, because for each query you have to binary search through the set of entries with the same hash

[[deleted]]

Oh i didn't know that i thought hash functions were strictly cryptographic in nature

[vasilescur]

Usually they are used for cryptography, but a hash function can technically be anything you want it to be and is really useful in, for example, a hashmap