Hash Table


Suppose n is the number of keys whose definitions we want to store, and suppose we use a table of N buckets, where N is perhaps a bit larger than n, but much smaller than the number of "possible" keys. A hash table maps a huge set of possible keys into N buckets by applying a hash function.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License