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:
“If someday I make a dictionary of definitions wanting single words to head them, a cherished entry will be “To abridge, expand, or otherwise alter or cause to be altered for the sake of belated improvement, one’s own writings in translation.””
—Vladimir Nabokov (1899–1977)
“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)
“Love can no more continue without a constant motion than fire can; and when once you take hope and fear away, you take from it its very life and being.”
—François, Duc De La Rochefoucauld (1613–1680)
“The last time I saw a head like that was in a bottle of formaldehyde.”
—Robert Pirosh, U.S. screenwriter, George Seaton, George Oppenheimer, and Sam Wood. Dr. Hugo Z. Hackenbush (Groucho Marx)