Once the application works correctly move to part 2 that has todo with analyzing the hashing mechanism itself.
One of the faster dictionary implementations is the hash table.As long as the table does not become too full, the time for addingand finding an element will be O(1). This performance does not comewithout some cost. The obvious penalty is that there will be spacein the table that is wasted. Another penalty is that the items inthe hash table are not in any particular order. As more items areadded to the hash table, the size of the table may be increased tomaintain the
OR
OR