forked from the-moonLight0/Hactober-fest-2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
circular queue.cpp
107 lines (93 loc) · 1.93 KB
/
circular queue.cpp
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
#include <iostream>
#define SIZE 5 //fixed size i.e 5
using namespace std;
class Queue {
private:
int items[SIZE], front, rear;
public:
Queue() {
front = -1;
rear = -1;
}
bool isFull() {
if (front == 0 && rear == SIZE - 1) {
return true;
}
if (front == rear + 1) {
return true;
}
return false;
}
bool isEmpty() {
if (front == -1)
return true;
else
return false;
}
void enQueue(int element) {
if (isFull()) {
cout << "Queue is full";
} else {
if (front == -1) front = 0;
rear = (rear + 1) % SIZE;
items[rear] = element;
cout << endl<< "Inserted " << element << endl;
}
}
int deQueue() {
int element;
if (isEmpty()) {
cout << "Queue is empty" << endl;
return -1;
} else {
element = items[front];
if (front == rear) {
front = -1;
rear = -1;
}
else {
front = (front + 1) % SIZE;
}
return element;
}
}
void display() {
int i;
if (isEmpty()) {
cout << endl
<< "Empty Queue" << endl;
} else {
cout<<"elements are "<<endl;
for (i = front; i != rear; i = (i + 1) % SIZE)
cout << items[i]<<" ";
cout << items[i];
}
}
};
int main() {
Queue q;
int op=0;
cout<<"Circular queue using array choose options:"<<endl;
while(op!=-1){
cout<<endl;
cout<<"1 for enqueue"<<endl;
cout<<"2 for dequeue"<<endl;
cout<<"3 for displaying"<<endl;
cout<<"-1 to exit"<<endl;
cin>>op;
cout<<endl;
if(op==1){
int val;
cout<<"Enter the value to be inserted"<<endl; cin>>val;
q.enQueue(val);
cout<<endl;
}
if(op==2){
cout<<"Removed element is "<<q.deQueue()<<endl<<endl;
}
if(op==3){
q.display();
cout<<endl;
}
}
}