# Question: we have a hash table with the size of 7...

###### Question details

We have a Hash Table with the size of 7

I | 0 | 1 | 2 | 3 | 4 | 5 | 6 |

H[i] | 8 | 31 | 44 | 55 | 3 | 47 | 64 |

And the hash function h(k) = Checksum(k) mod 7.

We use Quadratic probing.

a) In which order are the keys added

b) Is there an other order, that needs less average counts to
inspect hash tables on succesfull searches?