Implement a hopscotch hash table. Do not compare with other methods. Default the maximum hops to 4, give a constructor that allows this value to be changed.

class Map { public Map( ) public void put( KeyType key, ValueType val ) public ValueType get( KeyType key ) public boolean isEmpty( ) public void makeEmpty( ) private QuadraticProbingHashTable> items; private static class Entry { KeyType key; ValueType value; // Appropriate Constructors, etc. } } Figure 5.55