Hash Table Telephone Book: Collision Handling Comparison in C++
Telephone Book Database Using Hash Table in C++
/*
Author - Shantanu Wable
Consider a telephone book database of N clients. Make use of a hash table implementation to quickly look up a client's telephone number. Make use of 2 collision handling techniques and compare them using the number of comparisons required to find a set of telephone numbers.
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class Client {
char name[20];
ll ph1;
public:
Client() {
strcpy(name, "----");
ph1 = 0;
}
void printDetails() {
cout.width(20);
cout << name << " ";
cout.width(20);
cout << ph1 << "\n";
}
Client(char n[], ll teleph1) {
strcpy(name, n);
...