This is a basic hashtable implementation I threw together in about 30 mins. 1) Green flag 2) Click "Add Value" to enter some keys and values 3) Click "Get Value" to recall a value 4) Green flag to reset The hashtable list holds indices to the heap. The heap holds the keys and values, and the index to the next key-value pair with the same hash, in case of hash collision (it's a basic linked-list). To add or get a value, its hash is computed mod the length of the hashtable, and then the resulting number is used as the index, making the hashtable more efficient than brute-force looping a list for large lists. For a small amount of collisions, the time complexity for add and remove is almost O(1)
