Wrapping Up

We took a deep dive into hashing in this chapter. You learned about division hashing, hash function families, and how picking a hash function at random can help avert a worst-case scenario for a hash table.

In the next chapter, we’re going to take a look at a clever Monte Carlo algorithm that uses hashing to solve a common problem called substring search. In fact, there’s a good chance that you rely on substring search daily without even thinking about it. Along the way, we’ll also discuss some crucial computer science concepts, such as base number systems and how binary numbers truly work.

Onward!