Consider telephone book database of N clients. Make use of a hash table implementation to quickly look up client‘s telephone number. Make use of two collision handling techniques and compare them using number of comparisons required to find a set of telephone numbers
/************************** Telephone Book Database using Linear Probing ***************************/ #include <iostream> #include <bits/stdc++.h> using namespace std; #define max 10 struct client{ long int TeleNo; }; class hashtable{ client sm[max]; public: hashtable() //constructor { for(int i=0;i<max;i++) { sm[i].TeleNo=0; } } void insert(); void display(); void search(); void del();