Print this chapterPrint this chapter

Searching and Hashing

1. Objectives

  • To understand what search is and when it is appropriate.

  • To be able to explain and to implement sequential search and binary search.

  • To understand the idea of hashing as a search technique.

  • To introduce the unordered map abstract data type.

  • To implement a map abstract data type using hashing.


Source: Runestone Academy, https://runestone.academy/runestone/books/published/cppds/SearchHash/toctree.html
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 License.