data_structure/hashusingarray.cpp at main · Masterroy1210/data_structure · 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
#include<iostream>
using namespace std;


 #define size 5
 int arr[size];

void init()
{
    int i;
    for(i=0;i<size;i++)
    {
        arr[i]=-1;
    }
}


int insert(int value)
{
    int key;
    key = value%size;
    int index=key;


    while(arr[index]!= -1)
    {
        index = (index+1) % size;


        if(index==key)
        {
            cout<<"\nThe hash is full";
            return 0;

        }

    }

arr[index]=value;
        return 1;


}

void display ()
{
    int i;
   cout<<"---Hash table---"<<endl;
    for(i=0;i<size;i++)
    {
        cout<<arr[i];
        cout<<endl;
    }

}

int del(int value)
{
    int key= value%size;
    int index = key;
    while(arr[index]!=value)
    {
        index = (index+1)%size;
        if(index ==key)
        {
            return 0;
        }
    }
    arr[index]=-1;
    return 1;
}


int main()
{
    int k,v;

    for(int i=0;i<size;i++)
    {
         cout<<"\nEnter the key to be inserted in the hash table";
            cin>>k;
        insert(k);
    }
    display();
    cout<<"\nEnter the value you want to delete from the hash table";
    cin>>v;
    del(v);
    cout<<"\n ----Hash After Deletion ---"<<endl;
    display();

    return 0;
}