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)
“An absolute can only be given in an intuition, while all the rest has to do with analysis. We call intuition here the sympathy by which one is transported into the interior of an object in order to coincide with what there is unique and consequently inexpressible in it. Analysis, on the contrary, is the operation which reduces the object to elements already known.”
—Henri Bergson (1859–1941)
“What, to the American slave, is your Fourth of July? I answer: A day that reveals to him, more than all other days in the year, the gross injustice and cruelty to which he is the constant victim. To him your celebration is a sham.”
—Frederick Douglass (c.1817–1895)
“All good things were at one time bad things; every original sin has developed into an original virtue.”
—Friedrich Nietzsche (1844–1900)