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:
“I am hungry and you give me
a dictionary to decipher.”
—Anne Sexton (1928–1974)
“Human knowledge and human power meet in one; for where the cause is not known the effect cannot be produced. Nature to be commanded must be obeyed; and that which in contemplation is as the cause is in operation as the rule.”
—Francis Bacon (1560–1626)
“It is pretty obvious that the debasement of the human mind caused by a constant flow of fraudulent advertising is no trivial thing. There is more than one way to conquer a country.”
—Raymond Chandler (1888–1959)
“We see past time in a telescope and present time in a microscope. Hence the apparent enormities of the present.”
—Victor Hugo (1802–1885)