Question: Write code in C# to Hash an array of keys and display them with their hash code.
Answer: Hashtable is a widely used data structure to store values (i.e. keys) indexed with their hash code. Hash code is the result of the hash function and is used as the value of the index for storing a key. If two distinct keys hash to the same value the situation is called a collision and a good hash function minimizes collisions.
Question: How to choose a hash function appropriate for the data?
Answer: If your data consists of integers then the easiest hash function is to return the remainder of the division of key and the size of the table. It is important to keep the size of the table as a prime number. But more complex functions can be written to avoid the collision. If your data consists of strings then you can add all the ASCII values of the alphabets and modulo the sum with the size of the table (the code below depicts the same).
11 Tallypoints 16 Alphanumeric 19 Roman 34 Alphabets 46 Numbers
6 C# 15 C++ 18 C 19 Python 28 Java
Explanation: In HashFunction, we pass the arguments as a string to be hashed and the string data ‘values‘. The method ToCharArray converts the string to the character array and then we start a for loop from the start to the end of the character array. Inside the for loop we calculate the sum total of the ASCII values of each character in the array. The method GetUpperBound returns the value of the highest index of the array. Then hash function returns modulo of the sum total by the upper bound of the array ( in this case 49 since string values = new string ). Whereas in HashFunction2, we are passing the same arguments but this function is less likely to have collisions. Everything is basically the same except here we use Horner’s Rule to compute the polynomial function of 11.