I understand the definition of Load Factor and how Quadratic Probing works. But what happens in the case where quadratic probing cannot find an empty slot for a new element?
According to https://en.wikipedia.org/wiki/Quadratic_probing:
In the case of quadratic probing, with the exception of the triangular number case for a power-of-two-sized hash table, there is no guarantee of finding an empty cell once the table gets more than half full, or even before the table gets half full if the table size is not prime.
Does this mean that Load Factor should always be 0.5 for a Hash Table that uses Quadratic Probing?
What is the proof of this claim?