Dictionary Operation in Constant Time
Using linear probing, dictionary operation can be implemented in constant time. In other words, insert, remove and find operations can be implemented in O(1), as long as the load factor of the hash table is a constant strictly less than one. This analysis makes the (unrealistic) assumption that the hash function is completely random, but can be extended also to 5-independent hash functions. Weaker properties, such as universal hashing, are not strong enough to ensure the constant-time operation of linear probing, but one practical method of hash function generation, tabulation hashing, again leads to a guaranteed constant expected time performance despite not being 5-independent.
Read more about this topic: Linear Probing
Famous quotes containing the words dictionary, operation, constant and/or time:
“I am hungry and you give me
a dictionary to decipher.”
—Anne Sexton (1928–1974)
“It requires a surgical operation to get a joke well into a Scotch understanding. The only idea of wit, or rather that inferior variety of the electric talent which prevails occasionally in the North, and which, under the name of “Wut,” is so infinitely distressing to people of good taste, is laughing immoderately at stated intervals.”
—Sydney Smith (1771–1845)
“Justice is the set and constant purpose which gives every man his due.”
—Marcus Tullius Cicero (106–43 B.C.)
“Since there’s no help, come let us kiss and part;
Nay, I have done, you get no more of me,
And I am glad, yea, glad with all my heart
That thus so cleanly I myself can free;
Shake hands for ever, cancel all our vows,
And when we meet at any time again,
Be it not seen in either of our brows
That we one jot of former love retain.”
—Michael Drayton (1563–1631)