Performance of Chaining
Performance of hashing can be evaluated under the assumption that each key is equally likely to be hashed to any slot of the table (simple uniform hashing).
m = Number of slots in hash table
n = Number of keys to be inserted in hash tableLoad factor α = n/m
Expected time to search = O(1 + α)
Expected time to delete = O(1 + α)Time to insert = O(1)
Time complexity of search insert and delete is O(1) if α is O(1)
Separate Chaining Collision Handling Technique in Hashing
Separate Chaining is a collision handling technique. Separate chaining is one of the most popular and commonly used techniques in order to handle collisions. In this article, we will discuss about what is Separate Chain collision handling technique, its advantages, disadvantages, etc.
Contact Us