Essential algorithms and data structures

Searching algorithms

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.

Hash table videos

What extra is in the book?

Each algorithm / data structure has its own dedicated chapter in the book, which includes:

  1. Overview
  2. Typical applications / uses
  3. Typical operations
  4. The algorithm written out in simple-structured English
  5. The algorithm written out in pseudocode
  6. Full code listing in Python
  7. Additional code listings in Visual Basic and C# are also available to download
  8. Diagrammatic walk-through
  9. Efficiency discussion with reference to Big-O notation

A hard copy of the book is available on our shop and a free PDF copy is included for all premium subscribers.