//Syed Rais Ahmad
//Assign 10 Ans 1
//Hashing 


#include "stdafx.h"
#include <iostream.h>

#define TABSIZ 10

class Record
{
public: 
 int k;
 char r;
 bool flag;
 Record();
};

Record::Record()
{
	flag=false;
}

class Table 
{
private:
	Record Rec[TABSIZ] ;
	int Hash(int);
	int ReHash(int);
public:
	int Search(int);
	Insert(int,char);
	Print();
};

int Table::Hash(int k)
{
	return k%(TABSIZ-1);
}

int Table::ReHash(int indx)
{
	while (indx<TABSIZ && Rec[indx].flag) indx++;
	if (indx<TABSIZ && !Rec[indx].flag)	return indx;
	else return -1;
}


Table::Insert(int key,char rec)
{
	int h=Hash(key);
	if (Rec[h].flag) h=ReHash(h);
	if (h>-1) 
	{
		Rec[h].k=key; 
		Rec[h].r=rec;
		Rec[h].flag=true;
	}

}

Table::Print()
{
	int i=0;
	for(;i<TABSIZ;i++) cout << Rec[i].k << ' '<< Rec[i].r << '\n';
}

int Table::Search(int key)
{
	int indx=Hash(key);
	bool found=false;
	while(indx<TABSIZ && Rec[indx].flag && !found)   
	{
		if (Rec[indx].k==key) found=true; 
		indx++;
	}
	if (found) return indx-1;else
	return -1;

}

int main(int argc, char* argv[])
{
	Table t;
	int i=0;
	t.Insert(9,65);
	t.Insert(10,66);
	t.Insert(19,68);
	
	t.Print();
	cout <<	t.Search(19);
	return 0;
}