-
Notifications
You must be signed in to change notification settings - Fork 2
/
circularQue.cpp
146 lines (135 loc) · 2.48 KB
/
circularQue.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
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
#include <iostream>
using namespace std;
class Queue
{
public:
int *arr, front, rear, size;
Queue()
{
front = -1;
rear = -1;
}
};
bool isFull(Queue *Q)
{
if (Q->front == 0 && Q->rear == Q->size - 1)
{
return true;
}
if (Q->front == Q->rear + 1)
{
return true;
}
return false;
}
bool isEmpty(Queue *Q)
{
if (Q->front == -1)
return true;
else
return false;
}
void Enqueue(Queue *Q)
{
int value;
if (isFull(Q))
{
cout << endl
<< "Queue is full!\n";
}
else
{
if (Q->front == -1)
{
Q->front = 0;
Q->rear = 0;
}
else
{
Q->rear = (Q->rear + 1) % Q->size;
}
cout << "Enter the value : ";
cin >> value;
Q->arr[Q->rear] = value;
cout << "Enqueued " << value << " in the Queue\n";
}
}
int Dequeue(Queue *Q)
{
int value;
if (isEmpty(Q))
{
cout << "Queue is empty!\n"
<< endl;
}
else
{
value = Q->arr[Q->front];
cout << endl
<< "Dequeued " << value << " from Q\n";
if (Q->front == Q->rear)
{
Q->front = -1;
Q->rear = -1;
}
else
{
if (Q->front == Q->size - 1)
{
Q->front = 0;
}
else
{
Q->front = (Q->front + 1) % Q->size;
}
}
}
}
void Display(Queue *Q)
{
if (!isEmpty(Q))
{
cout << "Elements of Queue are : ";
for (int i = Q->front + 1; i <= Q->rear; i++)
{
cout << Q->arr[i];
}
}
else
{
cout << "Queue is empty\n";
}
}
int main()
{
Queue *Q = new Queue();
cout << "Enter the size of the Queue : ";
cin >> Q->size;
Q->arr = new int(Q->size);
int choice;
do
{
cout << "1. Enqueue\n2. Dequeue\n3. Display\n4. Exit\n\n";
cout << "Enter your choice : ";
cin >> choice;
switch (choice)
{
case 1:
Enqueue(Q);
break;
case 2:
Dequeue(Q);
break;
case 3:
Display(Q);
break;
case 4:
exit(0);
break;
default:
cout << "Sorry, invalid choice!\n";
break;
}
} while (choice != 4);
return 0;
}