Essential algorithms and data structures
Routines that find data within a data structure.
What is a hash table search?
The goal with a hash table is to immediately find an item in a sorted or unsorted list without the need to compare other items in the data set. It is how programming languages implement a dictionary data structure. A hashing function is used to calculate the position of an item in a hash table.
What extra is in the 200 page book?
Each algorithm / data structure has its own dedicated chapter in the book, which includes: