coding/Deque at master · vksudin/coding · 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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define size 10
class Deque{
    public:
    int arr[size];
    int front;
    int rear;
    Deque()
    {
        front=-1;
        rear=-1;
    }


    bool isFull()
    {
        if((front==0 && rear==size-1) || front==rear+1)
        return true;
        else
        return false;
    }

    bool isEmpty()
    {
        if(front==-1 && rear==-1)
        {
            return true;
        }
        return false;
    }

    void insert_front(int val)
    {
        if(isFull())
        {
            cout<<"Queue is full:"<<"\n";
            return;
        }
        if(front==-1 && rear==-1)
        {
            front=0;
            rear=0;
        }
        else if(front==0)
        {
            front=size-1;
        }
        else
        front--;

        arr[front]=val;
    }

    void insert_rear(int x)
    {
        if(isFull())
        {
            cout<<"Queue is full:"<<"\n";
            return;
        }
        if(front==-1 && rear==-1)
        {
            front=0;
            rear=0;
        }
        else if(rear==size-1)
        {
            rear=0;
        }
        else
        {
            rear++;
        }

        arr[rear]=x;
    }

    void Delete_front()
    {
        if(isEmpty())
        {
            cout<<"Queue is empty:"<<"\n";
            return;
        }
        if(front==rear)
        {
            front=-1;
            rear=-1;
        }
        else if(front==size-1)
        {
            front=0;
        }
        else
        front++;
    }

    void Delete_rear()
    {
        if(isEmpty())
        {
            cout<<"Queue is empty:"<<"\n";
            return;
        }
        if(front==rear)
        {
            front=-1;
            rear=-1;
        }
        else if(rear==0)
        {
            front=0;
        }
        else
        rear--;
    }

    void display()
    {
        int i=front;
        if(isEmpty())
        {
            cout<<"Queue is empty:"<<"\n";
            return;
        }
        while(i!=rear)
        {
            cout<<arr[i]<<"\n";
            i=(i+1)%size;
        }
        cout<<arr[rear]<<"\n";
    }

};

int main()
{
    Deque c;

    int choice,val;

    while(1)
    {
        cout<<"1 for insert at front:"<<"\n";
        cout<<"2 for insert at rear:"<<"\n";
        cout<<"3 for pop_front:"<<"\n";
        cout<<"4 for pop_pack:"<<"\n";
        cout<<"5 for check full condition:"<<"\n";
        cout<<"6 for check empty condition:"<<"\n";
        cout<<"7 for display:"<<"\n";
        cout<<"Any other number for stop the program:"<<"\n";

        cout<<"Enter choice:"<<"\n";
        cin>>choice;

        switch(choice)
        {
            case 1:
            cout<<"Enter the value:"<<"\n";
            cin>>val;
            c.insert_front(val);
            break;
            case 2:
            cout<<"Enter the value:"<<"\n";
            cin>>val;
            c.insert_rear(val);
            break;
            case 3:
            c.Delete_front();
            break;
            case 4:
            c.Delete_rear();
            break;
            case 5:
            if(c.isFull())
            cout<<"Queue is full:"<<"\n";
            else
            cout<<"Queue is not full:"<<"\n";
            break;
            case 6:
            if(c.isEmpty())
            cout<<"Queue is empty:"<<"\n";
            else
            cout<<"Queue is not empty:"<<"\n";
            break;
            case 7:
            c.display();
            break;
            default:
            return 0;
        }
    }
}