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)
“It requires a surgical operation to get a joke well into a Scotch understanding. The only idea of wit, or rather that inferior variety of the electric talent which prevails occasionally in the North, and which, under the name of “Wut,” is so infinitely distressing to people of good taste, is laughing immoderately at stated intervals.”
—Sydney Smith (1771–1845)
“A constant smirk upon the face, and a whiffling activity of the body, are strong indications of futility.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“Parents have railed against shelters near schools, but no one has made any connection between the crazed consumerism of our kids and their elders’ cold unconcern toward others. Maybe the homeless are not the only ones who need to spend time in these places to thaw out.”
—Anna Quindlen (b. 1952)