Java Reference
In-Depth Information
F
IGURE
27.5
The animation tool shows how quadratic probing works.
0
1
2
3
4
5
6
0
1
2
3
4
0
1
2
3
4
key: 45
h(12)
key: 45
key: 45
key: 58
key: 58
h(12) + h'(12)
key: 58
key: 4
key: 4
key: 4
h(12) + 2*h'(12)
5
6
5
6
key: 28
key: 28
key: 28
.
.
.
.
.
.
7
8
7
8
7
8
9
10
9
10
9
10
key: 21
key: 21
key: 21
F
IGURE
27.6
The secondary hash function in a double hashing determines the increment of the next index in the probe
sequence.
reaches the entire table. Note that the second function should never have a zero value, since
zero is not an increment.
27.10
✓
✓
What is open addressing? What is linear probing? What is quadratic probing? What
is double hashing?
Check
Point
27.11
Describe the clustering problem for linear probing.
Search WWH ::
Custom Search