Question

1. Starting with my code for Hash Table example (hash.cpp)
   1. Write your own main and insert function in C++ to insert the sequence of integers { 121, 81, 16, 100, 25, 0, 1, 9, 4, 36, 64, 49,) using a table of size 17.
   2. Implement your own rehashing algorithm of choice and run the same sequence of input using a table of size 7.

Code for hash.cpp:

const int TABLE_SIZE = 128;
 
class HashMap {
private:
      HashEntry **table;
public:
      HashMap() {
            table = new HashEntry*[TABLE_SIZE];
            for (int i = 0; i < TABLE_SIZE; i++)
                  table[i] = NULL;
      }
 
      int get(int key) {
            int hash = (key % TABLE_SIZE);
            while (table[hash] != NULL && table[hash]->getKey() != key)
                  hash = (hash + 1) % TABLE_SIZE;
            if (table[hash] == NULL)
                  return -1;
            else
                  return table[hash]->getValue();
      }
 
      void insert(int value) {
            /* your code here*/
                        
      }     
 
      ~HashMap() {
            for (int i = 0; i < TABLE_SIZE; i++)
                  if (table[i] != NULL)
                        delete table[i];
            delete[] table;
      }
};

Not entirely sure what HashEntry is, just assumed it was the name of a class

Answer 1

First of all in hash table we can store store data in the form of key and value pair.

You can replace the insert function by below code-

void insert(int key, int value)

{

int hash=key%TABLE_SIZE;

while(table[hash]!=NULL && table[hash]->getKey()!=key)

{

hash=(hash+1)%TABLE_SIZE;

}

if(table[hash]!=NULL)

delete table[hash];

table[hash]=new HashEntry(key,value);

}

To insert the array of integer you can treatthe sequence as key and array element as data.