Is there a way to optimize the use of Hashtable in java in terms
of Memory and lookups
what exactly are collisions in a hastable and how does it affect performance.
Any help would be greatly appreciated
Regards
of Memory and lookups
what exactly are collisions in a hastable and how does it affect performance.
Any help would be greatly appreciated
Regards
Comment