reply actually it is only o n if you double the table at each step then for a given n the rehashing will have cost at most n n n which is strictly less then n thus the o n complexity the same holds for any exponential growth like increasing table size by which would be more sensible for very large tables as you want to avoid large jumps in memory use for a very small variation of the input size the real proof can be done with geometric series