Hashing Example (continued)

Linear Probing: Try h(1993) + 1 mod 10.

If we keep getting collisions, the formula is h(d1d2d3d4) + k mod 10, in the kth attempt. If all 10 positions are full, a new hash table must be created and all the old elements placed in the new table.

0: 1982 IBM-PC

1:

2: 1984 Macintosh

3: 1993 Java

4:

5: 1978 VAX-11/780

6:

7:

8:

9:

Previous slide

Next slide

Back to first slide

View graphic version