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:
“The much vaunted male logic isn’t logical, because they display prejudices—against half the human race—that are considered prejudices according to any dictionary definition.”
—Eva Figes (b. 1932)
“Waiting for the race to become official, he began to feel as if he had as much effect on the final outcome of the operation as a single piece of a jumbo jigsaw puzzle has to its predetermined final design. Only the addition of the missing fragments of the puzzle would reveal if the picture was as he guessed it would be.”
—Stanley Kubrick (b. 1928)
“To keep up even a worthwhile tradition means vitiating the idea behind it which must necessarily be in a constant state of evolution: it is mad to try to express new feelings in a “mummified” form.”
—Alfred Jarry (1873–1907)
“It is always a sign of an unproductive time when it concerns itself with petty and technical aspects [in philology], and likewise it is a sign of an unproductive person to pursue such trifles.”
—Johann Wolfgang Von Goethe (1749–1832)