The best cache performance comes from Linear Probing, however it suffers from clustering. In terms of cache performance and clustering, quadratic probing falls somewhere in the middle. Cache performance is terrible with double caching, but there is no clustering. Here we have executed the quadratic probing program in python.

```
def printArray(arr, n):
for i in range(n):
print(arr[i], end = " ")
def hashing(table, tsize, arr, N):
for i in range(N):
hv = arr[i] % tsize
if (table[hv] == -1):
table[hv] = arr[i]
else:
for j in range(tsize):
t = (hv + j * j) % tsize
if (table[t] == -1):
table[t] = arr[i]
break
printArray(table, N)
arr = [ 334, 5, 761,
43, 922, 735, 1 ]
N = 7
L = 7
hash_table = [0] * 7
for i in range(L):
hash_table[i] = -1
hashing(hash_table, L, arr, N)
```

Output:

922 43 761 1 735 334 5

Fibonacci Series in Python Using Range

Fibonacci Series in Python Using Recursion Function

Python Program to Find Prime Numbers Between a Given Range

Python Program to Calculate Area of Circle Using Function

Python Program to Calculate Compound Interest

Program to Find Simple Interest in Python

Maximum of Two Numbers in Python Using Function

C Program to Find Armstrong Number Using Recursion