In theory, theory and practice are the same. In practice, they’re not. Yoggi Berra

Separate chaining

Language Java | Level Intermediate | Category Data structure | September 8, 2015 9:32 am


Data structure Description

Hash table uses key and value for storing the elements. If the key has duplicate value, it may lead to hashing Collision. Separate Chaining is one of name collision solution. It is a scheme which each position in the hash table has a list to handle collisions.

Write a program to implement separate chaining in hash table?


Output

   					 

Insert 10 items in the hash table
60,80,11,12,23,23,34,76,67,99,

Search '50' in the hash table
Could not find 50

Search '80' in the hash table
Found 80

				    

Comments


No comments available!

Please login to add comments.