In industry though, we usually wave our hands and say collisions are rare enough that on average lookups in a hash table are O(1) time. And there are fancy algorithms that keep the number of collisions low and keep the lengths of our linked lists nice and short.
