# quadratic searching

Not what you're looking for? Search our solutions OR ask your own Custom question.

H(x) is a hash function performed on an identifier x.

Show that if quadratic searching is carried out in the sequence (h(x) + q^2), (h(x) + (q-1)^2), ..., (h(x) + 1), h(x), (h(x) - 1), ..., (h(x) - q^2) with q = (b-1)/2, then the address difference % b between successive buckets being examined is b-2, b-4, b-6, ..., 5, 3, 1, 1, 3, 5, ..., b-6, b-4, b-2

Â© BrainMass Inc. brainmass.com March 4, 2021, 5:39 pm ad1c9bdddfhttps://brainmass.com/computer-science/hashing/quadratic-searching-hashing-4514

#### Solution Preview

In quadratic probing, a sequence of locations is explored until an empty one is found. But,instead of exploring

<br><br><br>h, h+1, h+2, h+3, h+4, ...

#### Solution Summary

This job cites quadratic searching.

$2.49