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)
“It is critical vision alone which can mitigate the unimpeded operation of the automatic.”
—Marshall McLuhan (1911–1980)
“Love not me for comely grace,
For my pleasing eye or face,
Nor for any outward part:
No, nor for a constant heart!”
—Unknown. Love Not Me for Comely Grace (l. 1–4)
“What a phenomenon it has been—science fiction, space fiction—exploding out of nowhere, unexpectedly of course, as always happens when the human mind is being forced to expand; this time starwards, galaxy-wise, and who knows where next.”
—Doris Lessing (b. 1919)