Overview

Published

2023-08-06

Week 10: Linear probing; rehashing; quadratic probing; double hashing

This week, we’ll learn more about hash tables and collision resolution policies, including linear probing, rehashing, quadratic probing, and double hashing.

Learning Objectives

By the end of this module, you will be able to:

Explain the pros and cons of various collision resolution policies, including separate chaining, linear probing, quadratic probing, and double hashing.
Determine which of these policies might be best for a given use case, and justify your choice.
Understand how to implement various collision resolution policies in C++.

To achieve this module’s objectives, please watch the introductory video (above), and complete the following:

Read: Essential Algorithms, Chapter 8 (hash tables)

Read / view the following content and complete any comprehension checks:

Linear probing and rehashing
Quadratic probing
Double Hashing

Original author: Clayton Cafiero < [given name] DOT [surname] AT uvm DOT edu >

No generative AI was used in producing this material. This was written the old-fashioned way.