tags:

views:

45

answers:

2
+2  Q: 

Open Addressing vs. Separate Chaining

Which hashmap collision handling scheme is better when the load factor is close to 1 to ensure minimum memory wastage?

I personally think the answer is open addressing with linear probing, because it doesn't need any additional storage space in case of collisions. Is this correct?

related questions

How do I use a foreach loop in Java to loop through the values in a HashMap?
strange HashMap.put() behaviour
Storing MATLAB structs in Java objects
HashMap intialization parameters (load / initialcapacity)
JavaScript Hashmap Equivalent
How to use SGI STL hash_map?
Why AbstractCollection does not implement equals() ?
If construct in hashmap.put call
Which data structure would you use: TreeMap or HashMap? (Java)
Default HashMap probing in Java
Simple hashmap implementation in C++
Is there a SoftHashMap in Java?
How to use sgi hash_table in VS2005?
How to use JEDI TJCLHashMap classes?
Threading issues in a Java HashMap
Why do I get an OutOfMemoryError when inserting 50,000 objects into HashMap?
What is a safe equivalent of non-void STL erase?
Why not allow an external interface to override hashCode/equals for a HashMap?
Java: Arrays & Vectors
What are hashtables and hashmaps and their typical use cases?
When using a HashMap are values and keys guaranteed to be in the same order when iterating?
Is a Python dictionary an example of a hashmap?
Is it safe to get values from a java.util.HashMap from multiple threads (no modification)?
Java hashmap vs hashtable
How Do I Create a Hash Table in Java?