# Hash Maps & Lookup

**Track:** Objects, Data Structures & Algorithms — Creative Coding — the existing 50
**Framework / surface:** p5.js
**Level:** Intermediate
**Prerequisites:** Arrays, Typography & Text Systems

**In one line:** Turn a key into a bucket for instant lookup.

## Theory, aesthetics & inspiration

A hash map turns a key into an integer, that integer into a bucket, and a search into a near-instant lookup—trading order for speed by computing where a value lives rather than scanning for it. The hashing idea, credited to Hans Peter Luhn at IBM, is analyzed in depth in the third volume of Donald Knuth's "The Art of Computer Programming," "Sorting and Searching," where the central tension is collision: distinct keys landing in the same bucket. The aesthetic is less pictorial than architectural—the dictionary as a designed indirection—but visualizing the spread of keys across buckets reveals the quiet mathematics that makes constant-time access feel effortless.