very tight bound is that we use a pessimistic estimate on the number of key moves needed to
accommodate a new element in the dictionary. Often a free cell will be found even though it
could have been occupied by another key in the dictionary. We also pessimistically assume
that a large fraction of key moves will be spent backtracking from an unsuccessful attempt
to place the new key in the first table.