In java
Once the applicationworks correctly move to part 2 that has to do with analyzing thehashing mechanism itself.
One of the fasterdictionary implementations is the hash table. As long as the tabledoes not become too full, the time for adding and finding anelement will be O(1). This performance does not come without somecost. The obvious penalty is that there will be space in the tablethat is wasted. Another penalty is that the items in the hash tableare not in any particular order. As more items are added to thehash table, the size of the table may be increased to
OR
OR