Reimplementing Ruby's Hash
summary
Nathan Long builds a custom Hash class in Ruby to demonstrate how hash tables achieve constant-time key lookup regardless of size. The talk walks through an implementation in Ruby, uses Big O analysis to explain and optimize performance, and connects lessons from the hash implementation to broader topics like programming languages and databases.
AI-written summary · about
related talks
31mBig O in a Homemade Hash
11mWhy Hashes Will Be Faster in Ruby 2.0
25mMaking Hash Parallel, Thread-Safe and Fast!
34mLet's subclass Hash - what's the worst that could happen?
32mThe Humble Hash
34mBeyond the language. An introduction to algorithms.
36mWhy Ruby Isn't Slow
34mHow to optimize Ruby internal.