Hash Tables are an efficient method of storing a small number, n, of integers from a large range 𝑈={0,...,2^w-1}. The term hash table includes a broad range of data structures. This wiki sub focuses on two of the most common implementations of hash tables: hashing with chaining and linear probing.

Chained Hash Tables

Linear Hash Tables

Very often hash tables store types of data that are not integers. In this case, an integer hash code is associated with each data item and is used in the hash table.

Hash Codes

Some of the methods used in the corresponding code require random choices of integers in some specific range. In the code some of these "random" integers are hard-coded constants. These constants were obtained using random bits generated from atmospheric noise.