Solution 1: Insert implies Replace
Array elements are pointers to lists.
If we assume a uniform distribution over keys, a search is
If we can maintain performance for multiple entries for the same
key, perhaps we can do the same while mapping multiple keys into the same
In other words, use Hash Tables.