Categories:
.NET (357)
C (330)
C++ (183)
CSS (84)
DBA (2)
General (7)
HTML (4)
Java (574)
JavaScript (106)
JSP (66)
Oracle (114)
Perl (46)
Perl (1)
PHP (1)
PL/SQL (1)
RSS (51)
Software QA (13)
SQL Server (1)
Windows (1)
XHTML (173)
Other Resources:
Describe one simple rehashing policy.
Describe one simple rehashing policy.
✍: .fyicenter.com
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, 3351👍, 0💬
Related Topics:
Popular Posts:
How To Set session.gc_maxlifetime Properly? - PHP Script Tips - Understanding and Using Sessions As ...
How To Avoid the Undefined Index Error? - PHP Script Tips - Processing Web Forms If you don't want y...
What are unadjusted function points and how is it calculated? Unadjusted function points = ILF + EIF...
What is the sequence of UML diagrams in project? First let me say some fact about this question, you...
How To Run a JUnit Test Class? A JUnit test class usually contains a number of test methods. You can...
