Hashing schemes - basics

• Hash function

  • Method for computing table index from key

• Collision resolution strategy

  • How to handle two keys that hash to the same index

We want to store N items in a table of size M, at a location computed from the key K.

Two main aspects:

Previous slide

Next slide

Back to first slide

View graphic version