Summary

A hash_table with separate_chaining stores entries in an array of buckets. A hash_function maps a key to a bucket_index. Each bucket holds a linked_list of key_value_pairs to resolve collisions. Typical operations are insertion, lookup, and deletion. With a low load_factor, average time is near O(1). High load_factor increases chain length. resizing rehashes items into more buckets. Order within a chain is not guaranteed.