Hashing Technique

Hashing Technique is a searching technique, designed using mathematical model of functions. Ideal hashing takes O(1). Video by Abdul Bari.


Given a hash table with m=11 entries and the following hash function
 h(key) = key mod m
insert the keys {22, 1, 13, 11, 24, 33, 18, 42, 31} in the given order (from left to right) to the hash table using each of the following hash methods:
a. Chaining
b. Linear-Probing
c. Quadratic-Probing