3. Hash Tables and Bloom Filters
Learning Objectives
By the end of this chapter, you will be able to:
- Identify lookup-related problems easily in any large-scale application
- Evaluate whether a problem is suited for a deterministic or non-deterministic lookup solution
- Implement an efficient lookup solution based on a scenario
- Implement generic solutions provided as part of C++ STL in large applications
In this chapter, we'll look at the problem of fast lookup. We will learn about the various approaches to solving this problem and understand which one can be used for a given situation.
Introduction
Lookup is nothing but checking whether an element is present in a container or finding the corresponding value for a key in the container. ...
Get C++ Data Structures and Algorithm Design Principles now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
