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:
“He who eats alone chokes alone.”
—Arab proverb, quoted in H.L. Mencken’s Dictionary of Quotations (1942)
“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)
“If ever thou shalt love,
In the sweet pangs of it remember me;
For such as I am, all true lovers are,
Unstaid and skittish in all motions else
Save in the constant image of the creature
That is beloved.”
—William Shakespeare (1564–1616)
“Every time you hear a bell ring, it means that some angel’s just got his wings.”
—Frances Goodrich (1891–1984)