Custom-DataStructure/Hash Table.cpp at master · s-a-tanjim/Custom-DataStructure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <iostream>
#define TABLE_SIZE 10
using namespace std;

//There are three type of method to avoid collision.
//Each of them implemented in different class

class LinearProbing
{
  int arr[TABLE_SIZE];

public:
  LinearProbing()
  {
    for (int i = 0; i < TABLE_SIZE; i++)
      arr[i] = -1;
  }
  void setVal(int key)
  {
    int index = hashFunc(key);
    if (index < TABLE_SIZE)
      arr[index] = key;
    else
      cout << "Not Enough Space!\n";
  }
  int hashFunc(int key)
  {
    int i = key % TABLE_SIZE;
    int j = 0;
    while (arr[i] != -1 && j < TABLE_SIZE)
    {
      i = (i + 1) % TABLE_SIZE;
      j++;
    }
    if (j == TABLE_SIZE)
    {
      cout << "Not enough space!!\n";
      return 0;
    }
    return i;
  }
  bool search(int key)
  {
    for (int i = key; i < TABLE_SIZE && arr[i] != -1; i++)
    {
      if (arr[i] == key)
        return true;
    }
    return false;
  }
  void display()
  {
    for (int i = 0; i < TABLE_SIZE; i++)
      cout << arr[i] << "   ";
    cout << "\n\n";
  }
};

class quadraticProbing
{
  int arr[TABLE_SIZE];

public:
  LinearProbing()
  {
    for (int i = 0; i < TABLE_SIZE; i++)
      arr[i] = -1;
  }
  void setVal(int key)
  {
    int index = hashFunc(key);
    if (index < TABLE_SIZE)
      arr[index] = key;
    else
      cout << "Not Enough Space!\n";
  }
  int hashFunc(int key)
  {
    int i = key % TABLE_SIZE;
    while (arr[i] != -1 && i < TABLE_SIZE)
      i++;
    return i;
  }
  bool search(int key)
  {
    for (int i = key; i < TABLE_SIZE && arr[i] != -1; i++)
    {
      if (arr[i] == key)
        return true;
    }
    return false;
  }
  void display()
  {
    for (int i = 0; i < TABLE_SIZE; i++)
      cout << arr[i] << "   ";
    cout << "\n\n";
  }
};

int main()
{

  LinearProbing l;
  l.setVal(15);
  l.setVal(25);
  l.setVal(35);
  l.setVal(45);
  l.setVal(55);
  l.setVal(65);
  l.setVal(5);
  l.setVal(1);
  l.setVal(2);
  l.setVal(7);

  if (l.search(0))
  {
    cout << "Found!\n";
  }
  else
  {
    cout << "Not Found!\n";
  }

  l.display();
}