Open Hashing orHashing with Chaining

3

2

1

0

6

5

4

a

d

e

b

c

• Put a little dictionary at each entry

  • choose type as appropriate
  • common case is unordered linked list (chain)

• Properties

  • ? can be greater than 1
  • performance degrades with length of chains

h(a) = h(d)

h(e) = h(b)

Previous slide

Next slide

Back to first slide

View graphic version