quadratic probing is an open addressing scheme in computer programming for resolve hash collisions in hash tables. } quadratic probing can be a more efficient algorithm in a open addressing table, since it better avoids the clustering problem that can happen with linear probing, although it is not immune.

COMING SOON!

```
#!/usr/bin/env python3
from hash_table import HashTable
class QuadraticProbing(HashTable):
"""
Basic Hash Table example with open addressing using Quadratic Probing
"""
def __init__(self, *args, **kwargs):
super().__init__(*args, **kwargs)
def _collision_resolution(self, key, data=None):
i = 1
new_key = self.hash_function(key + i * i)
while self.values[new_key] is not None and self.values[new_key] != key:
i += 1
new_key = (
self.hash_function(key + i * i)
if not self.balanced_factor() >= self.lim_charge
else None
)
if new_key is None:
break
return new_key
```