map in C++ v/s HashMap in Java
Could you tell me if the time complexity of operations with a map in C++ and HashMap in Java are the same?
IF not, please tell me the time complexity of operations such as Insert/Delete/Search in a map in C++.
Thanks!
IF not, please tell me the time complexity of operations such as Insert/Delete/Search in a map in C++.
Thanks!
CEHJ
I would doubt they were any different. In theory both languages should use the best possible complexity
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER
I'm sorry.
Can you tell if C++'s hash_map and Java's HashMap have the same time and space complexity?
Can you tell if C++'s hash_map and Java's HashMap have the same time and space complexity?
>> Can you tell if C++'s hash_map and Java's HashMap have the same time and space complexity?
I'm not 100% sure about the Java HashMap implementation, but afaik there is a normal hash table behind it.
The std::hash_map in C++ is currently an extension, so the specific implementation depends on the implementer (but the general consensus seems to be a normal hash table).
So, yes : the complexities would be very similar, if not the same.
As always with hash tables though : a lot depends on your choice of hash function, and a proper dimensioning of the hash table (as well as collision strategy if appropriate).
I'm not 100% sure about the Java HashMap implementation, but afaik there is a normal hash table behind it.
The std::hash_map in C++ is currently an extension, so the specific implementation depends on the implementer (but the general consensus seems to be a normal hash table).
So, yes : the complexities would be very similar, if not the same.
As always with hash tables though : a lot depends on your choice of hash function, and a proper dimensioning of the hash table (as well as collision strategy if appropriate).
can you tell about your keys? and the number of entries now and in future? is your main concern a fast read and find of existing keys or a fast insert/update/delete ?
you may think of making test implementations for either map. if you can serve realistic test data you reliably will know what is the best container for your purpose.
Sara
you may think of making test implementations for either map. if you can serve realistic test data you reliably will know what is the best container for your purpose.
Sara
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.