The Misunderstood Hashable Types and Why Dictionaries Are Called Dictionaries * [Club]

"Pick up a dictionary. No, not that one. The real dictionary you have on your bookshelf, the one that has pages made of paper, which you use to look up the meaning of English words. Or whatever other language. But let's assume it's an English dictionary. Now, look up zymology. I'll wait... Done? It probably didn't take you too long to find zymology."

"You know z is the last letter of the alphabet, so you opened the dictionary on a page towards the end of the book. Then you looked at a random word on the page or maybe the word listed in the header. Does it start with z? Yes? Look at the word's second letter. No? Open the book to another page further in the dictionary. You get the idea."

A physical dictionary relies on a known global order (the alphabet) to find words quickly by jumping to appropriate pages. Without a known ordering, locating a specific word by manual search becomes slow and random. Hash values provide an alternative: compute a deterministic numeric value for each hashable object and map that value to a bucket or location, enabling near-constant-time lookup without relying on an ordering. Hashing trades off order for direct addressing and requires handling collisions. Visual or video demonstrations can complement text explanations for learners who prefer different communication modes.

Read at Thepythoncodingstack