I got the following from wikipedia:
"The main tradeoffs between these methods are that linear probing has the best cache performance but is most sensitive to clustering, while double hashing has poor cache performance but exhibits virtually no clustering; quadratic probing falls in-between in both areas."
Since linear probing has the best cache performance, will it no suffer if there are too many deletions? Or is it the other way around, with double hashing being most effective with many deletions.