When hashing n items into a hash table with k slots
The main statistic for a hash table is the load factor:
α=n/k
We can visualize this by following statement and the graph.
The length of probe sequence is proportional to α/(1−α). As the load factor α approaches 1, probe times goes to infinite.
So the time complexity would be O(1/1-α)