-
Notifications
You must be signed in to change notification settings - Fork 0
/
Comparison_of_Two_Circular_Queues.cpp
192 lines (162 loc) · 4.3 KB
/
Comparison_of_Two_Circular_Queues.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
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
#include <iostream>
using namespace std;
/*---------------------------------------------------------------------------*/
typedef struct Queue{
int cqueue[5];
int front, rear, n;
};
/*---------------------------------------------------------------------------*/
void insertCQ(Queue *q, int val){
if (q->front == (q->rear + 1) % q->n){
cout << "Queue Overflow\n";
return;
}
if (q->front == -1){
q->front = 0;
q->rear = 0;
}
else{
q->rear = (q->rear + 1) % q->n;
}
q->cqueue[q->rear] = val;
}
/*---------------------------------------------------------------------------*/
void deleteCQ(Queue *q){
if(q->front == -1){
cout << "Queue Underflow\n";
return;
}
cout << "Element deleted from queue is " << q->cqueue[q->front] << endl;
if (q->front == q->rear){
q->front = -1;
q->rear = -1;
}
else{
q->front = (q->front + 1) % q->n;
}
}
/*---------------------------------------------------------------------------*/
void displayCQ(Queue *q){
int f = q->front;
int r = q->rear;
if(f <= r){
while(f <= r){
cout << q->cqueue[f] << " ";
f++;
}
}
else{
while(f <= (q->n - 1)){
cout << q->cqueue[f] << " ";
f++;
}
f = 0;
while(f <= r){
cout << q->cqueue[f] << " ";
f++;
}
}
cout << endl;
}
/*---------------------------------------------------------------------------*/
bool compare (Queue *q1, Queue *q2){
int f1 = q1->front;
int r1 = q1->rear;
int n1 = q1->n;
int f2 = q2->front;
int r2 = q2->rear;
int n2 = q2->n;
if (f1 == -1 && f2 == -1){
cout << "Queues are Empty\n";
return true;
}
if (f1 == -1 || f2 == -1){
return false;
}
while ((f1 != r1) && (f2 != r2)){
if (q1->cqueue[f1] != q2->cqueue[f2]){
return false;
}
if (f1 == (n1 - 1)){
f1 = 0;
}
else{
f1++;
}
if (f2 == (n2 - 1)){
f2 = 0;
}
else{
f2++;
}
}
if (q1->cqueue[f1] != q2->cqueue[f2]){
return false;
}
if ((f1 != r1) || (f2 != r2)){
return false;
}
else{
return true;
}
}
/*---------------------------------------------------------------------------*/
int main(){
Queue q1, q2;
q1.front = -1;
q2.front = -1;
q1.rear = -1;
q2.rear = -1;
q1.n = 5;
q2.n = 5;
int ch, val;
cout << "1 —————> Insert (Queue 1)\n";
cout << "2 —————> Insert (Queue 2)\n";
cout << "3 —————> Delete (Queue 1)\n";
cout << "4 —————> Delete (Queue 2)\n";
cout << "5 —————> Display (Queue 1)\n";
cout << "6 —————> Display (Queue 2)\n";
cout << "7 —————> Compare\n";
cout << "8 —————> Exit\n";
do{
cout << "\nEnter your choice : ";
cin >> ch;
switch(ch){
case (1):
cout << "Enter the value to be inserted in Queue 1 : ";
cin >> val;
insertCQ(&q1, val);
break;
case (2):
cout << "Enter the value to be inserted in Queue 2 : ";
cin >> val;
insertCQ(&q2, val);
break;
case (3):
deleteCQ(&q1);
break;
case (4):
deleteCQ(&q2);
break;
case (5):
displayCQ(&q1);
break;
case (6):
displayCQ(&q2);
break;
case (7):
if (compare(&q1, &q2)){
cout << "The Queues are Equal\n";
}
else{
cout << "The Queues are Not Equal\n";
}
break;
case (8):
break;
default:
cout << "Enter a value between 1 and 8";
}
}while(ch != 8);
}
/*---------------------------------------------------------------------------*/