Let n = number of items in table.
The worst-case running time of this algorithm is O(n).
For n calls the worst-case running time is O(n2).
Double the table size when full. This expansion is performed once every
power of 2 steps in 1...n.
The total amortized cost of a single call to TableInsert is 3.