Describe one simple rehashing policy.
Q
Describe one simple rehashing policy.
✍: .fyicenter.com
A
The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i]. The following function is used to generate alternative locations:
rehash(j) = (j + 1) mod h
where j is the location most recently probed. Initially j = i, the hash code for K. Notice that this version of rehash does not depend on K.
2012-04-16, 3398👍, 0💬
Related Topics:
Assuming that: char* p = "abc" int a = 123; .....
3. Assuming that: char* p = "abc"; int a = 123; Fully parenthesize the following expressions and evaluate them: *p++; *--p; *--p++; a--; ++a; ++a--; 2012-04-19, 3946👍, 0💬