Java Hashing

Hashing is the technique to convert the range of key-value pairs to a range of indices. In hashing, we use hash functions to map keys to some values.

Example :
Let arr=[11,33,22,14]
hashIndex = (key %10)

Collision: The hash function may map two key values to a single index. Such a situation is known as a collision.

Example :
Let 1l=[22,42,64,71]
H(x) = keys%10

In the above image, you can see that the 22 and 44 are mapped to the index number 2. Therefore we need to avoid the collision. Following techniques are used to avoid collision in hashing :

Open addressing

Chaining

Conclusion

In this page (written and validated by A. Gawali) you learned about Java Hashing . What's Next? If you are interested in completing Java tutorial, your next topic will be learning about: Java Date and Time.

Incorrect info or code snippet? We take very seriously the accuracy of the information provided on our website. We also make sure to test all snippets and examples provided for each section. If you find any incorrect information, please send us an email about the issue: mockstacks@gmail.com.

Share On:

Mockstacks was launched to help beginners learn programming languages; the site is optimized with no Ads as, Ads might slow down the performance. We also don't track any personal information; we also don't collect any kind of data unless the user provided us a corrected information. Almost all examples have been tested. Tutorials, references, and examples are constantly reviewed to avoid errors, but we cannot warrant full correctness of all content. By using Mockstacks.com, you agree to have read and accepted our terms of use, cookies and privacy policy.