Question

What is hashing in data structure?

Answer 1

Hashing is a technique to convert a range of key values into a range of indexes of an array.

We're going to use modulo operator to get a range of key values.

Consider an example of hash table of size 20, and the following items are to be stored. Item are in the (key,value) format.