Shares
facebook sharing button Share
twitter sharing button Tweet
wordpress sharing button Share
blogger sharing button Share
email sharing button Email
arrow_left sharing button
arrow_right sharing button

Hashing - Collision

<<Previous - Hash Table

Next - Open Hashing >>




Collision

When two keys are hashed to same location, then this situation is called collision. This will be avoided by using two simple methods. We are going to discuss them one by one.

  1. Open Hashing otherwise called as Separate Chaining
  2. Closed Hashing otherwise called as Open Addressing

<<Previous - Hash Table

Next - Open Hashing>>



















Hashing - Collision

<<Previous - Hash Table

Next - Open Hashing >>




Collision

When two keys are hashed to same location, then this situation is called collision. This will be avoided by using two simple methods. We are going to discuss them one by one.

  1. Open Hashing otherwise called as Separate Chaining
  2. Closed Hashing otherwise called as Open Addressing

<<Previous - Hash Table

Next - Open Hashing>>