Resolving Collisions

Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Structural Indexing
1.1. Implementation
1.2. Complexity of Separate Chaining
2. Open Addressing
2.1. Implementation
2.2. Choosing f(i)
2.3. Analysis of Open Addressing

OK, we've got our hash functions. They're not perfect, so we can expect collisions. How do we resolve these collisions?

There are two general approaches:

In the Forum:

(no threads at this time)