A simple (Java based) hashed dictionary with 256 hashable locations, and three methods:
• insert - allows for a (key, value) pair to be added to the dictionary
• delete - allows for deletion of a (key, value) pair, referenced by the key
• search - allows for the location of a (key, value) pair, referenced by the key
Note:
• The hash function used modulus (%) to calcuate the hash value
• Uses linear probing to handle hash collisions
• Example tests are in the main method for examplifying the functionalities
• The number of hashable locations can be modified to be larger, but the code struggles with values > ≈ 214748360
• Works with JDK 17 or JDK 23 (and probably most/all versions)