A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below
| 0 | |
|---|---|
| 1 | |
| 2 | 42 |
| 3 | 23 |
| 4 | 34 |
| 5 | 52 |
| 6 | 46 |
| 7 | 33 |
| 8 | |
| 9 |
How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?
Reveal answer
Fill a bubble to check yourself
