Hash Table Algorithms

Compute a bucket index with key modulo table size.

Hash a key and place its entry into the selected bucket.

Hash a key and inspect the bucket or probe path.

Remove an entry by key from a bucket or probing sequence.

Resolve collisions by checking the next table slot in sequence.

Delete an element using lazy deletion (tombstones).

Insert an element using linear probing for collisions.

Search for an element in a linear probing hash table.

Resize the table and reinsert keys when load factor grows too high.

Delete an element from a separate chaining hash table.

Insert an element using separate chaining for collisions.

Search for an element in a separate chaining hash table.