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, 3345👍, 0💬
Related Topics:
Popular Posts:
Example of using Regular Expressions for syntax checking in JavaScript ... var re = new RegExp("^(&a...
What Is a CAPTION Tag/Element? - XHTML 1.0 Tutorials - Understanding Tables and Table Cells A "capti...
What are the core functionalities in XML .NET framework? Can you explain in detail those functionali...
What is normalization? What are different types of normalization? It is set of rules that have been ...
What is the purpose of the wait(), notify(), and notifyAll() methods? The wait(),notify(), and notif...
