The quadratic hash increments the increment when searching for an empty entry. In consequence, if two searches from different starting points hit the same element it does not mean that the same entry will be hit later on as the search paths will diverge. In consequence, both the maximum search length and the average length of search are significantly smaller than for the linear hash.
