Hash Tables: Collisions, Load Factor, Expected Cost

Collisions are resolved by chaining or open addressing; with load factor $\alpha = n/m$ kept $O(1)$, search costs expected $\Theta(1+\alpha) = O(1)$ under simple uniform hashing.