*Separate chaining : (multi-lists, sequential search)
 
Key
A    
 S  E A R C H I N G E X A M P L E
Hash 1 8 5 1 7 3 8 9 3 7 5 8 7 8 5 1 5 mod     11
 
 
0 1 2 3 4 5 6 7 8 9 10
  A M C E G H I
A X N E R S
A E
L P
 

*Linear probing   h(k) , h(k) + 1 , h(k) + 2 , .......
 
Key A S E A R C H I N G E X A M P L E
Hash 1 0 5 1 18 3 8 9 14 7 5 5 1 13 16 12 5 mod 19
 
 
 
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
A
S A
S A E
S A A E
S A A E R
S A A C E R
S A A C E H R
S A A C E H I R
S A A C E H I N R
S A A C E G H I N R
S A A C E E G H I N R
S A A C E E G H I X N R
S A A C A E E G H I X N R
S A A C A E E G H I X M N R
S A A C A E E G H I X M N P R
S A A C A E E G H I X L M N P R
S A A C A E E G H I X E L M N P R

 
 

Clustering.   How about h(k) + C ? (C, M) = 1
                    Even worse ! Still clustering ! h(k) + C slower than linear probing