- Calculate the hash value and initial index of the entry to be inserted
- Search the position linearly
- While searching, the distance from initial index is kept which is called DIB (Distance from Initial Bucket)
- If empty bucket is found, we can insert the entry with DIB here
- If we encounter a entry which has less DIB than the one of the entry to be inserted, swap them.