Hashing turns a key into an array index, so a hash table can search, insert and delete in O(1) on average.