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:
““Will I have to use a dictionary to read your book?” asked Mrs. Dodypol. “It depends,” says I, “how much you used the dictionary before you read it.””
—Alexander Theroux (b. 1940)
“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)
“Liberalism, austere in political trifles, has learned ever more artfully to unite a constant protest against the government with a constant submission to it.”
—Alexander Herzen (1812–1870)
“Chaucer is fresh and modern still, and no dust settles on his true passages. It lightens along the line, and we are reminded that flowers have bloomed, and birds sung, and hearts beaten in England. Before the earnest gaze of the reader, the rust and moss of time gradually drop off, and the original green life is revealed. He was a homely and domestic man, and did breathe quite as modern men do.”
—Henry David Thoreau (1817–1862)