When you insert items in a hash, does the key get encoded to a physical memory space, hence the very fast lookup times? i.e constant lookup times.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
When you insert items in a hash, does the key get encoded to a physical memory space, hence the very fast lookup times? i.e constant lookup times.
It has near constant look up times (provided you have a trivial amount of collisions) by using an array of
Entryreferences.Java doesn’t manipulate address locations directly as these can be changed by the GC at any time.