If implemented correctly and with minimum number of collisions, SOME of a Map's methods are constant (or approximately constant) time. Regardless of 'what you heard', why not prove it to yourself? A...
Type: Posts; User: copeg
Re: Map implementation.
If implemented correctly and with minimum number of collisions, SOME of a Map's methods are constant (or approximately constant) time. Regardless of 'what you heard', why not prove it to yourself? A...
Re: Map implementation.
Well for what its worth, that is not how to implement a Map. The advantage of a Map is that it provides constant time performance for its lookup/insert/delete methods - not linear time performance (a...
Re: Map implementation.
As helloworld mentioned, why try and reinvent the wheel? There are already Map implementations that should be more than sufficient in most contexts (HashMap, LinkedHashMap, TreeMap....), or rethink...