-
Notifications
You must be signed in to change notification settings - Fork 46
/
queue.cpp
155 lines (123 loc) · 3.39 KB
/
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
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
// Copyright 2019 Souvik Biswas
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#include <iostream>
using namespace std;
// Defining the maximum size of the queue to be 10
#define MAX 10
// Defining a class to store the member variables
// and member functions required
class Queue {
int queue[MAX], front, rear;
public:
Queue(): front(-1), rear(-1) {}
void insert(int );
int del();
void display();
};
/*
ALGORITHM FOR INSERTING AN ELEMENT IN THE QUEUE:
1) IF REAR = MAX-1
WRITE Overflow
EXIT
2) REAR = REAR + 1
3) QUEUE[REAR] = VALUE
4) EXIT
*/
void Queue :: insert(int value) {
if(rear == MAX-1) {
cout<<"The Queue is full !\n";
}
else {
rear++;
queue[rear] = value;
}
}
/*
ALGORITHM FOR DELETING AN ELEMENT FROM THE QUEUE:
1) IF FRONT = REAR
WRITE Underflow
RETURN -1
EXIT
2) FRONT = FRONT + 1
3) VALUE = QUEUE[FRONT]
4) RETURN VALUE
5) EXIT
*/
int Queue :: del() {
// When front is equal to rear, then the queue is empty
if(front == rear) {
cout<<"The Queue is empty !\n";
return -1;
}
else {
// Incrementing front
front++;
// Storing the element in front position in value
int value = queue[front];
return value;
}
}
// Display the elements of the Queue by incrementing
void Queue :: display() {
// When front is equal to rear, then the queue is empty
if(front == rear) {
cout<<"The Queue is empty !\n";
}
else {
// Printing each element
for(int i=front+1; i<=rear; i++) {
cout<<queue[i]<<" ";
} cout<<endl;
}
}
// Main Function
int main() {
int option, value;
Queue q;
do {
cout<<"\n**** MENU ****\n"
<<"1. Insert\n"
<<"2. Delete\n"
<<"3. Display\n"
<<"4. Exit\n";
cout<<"Enter your option: ";
cin>>option;
switch(option) {
case 1: cout<<"Enter the value to be inserted: ";
cin>>value;
q.insert(value);
break;
case 2: value = q.del();
if(value != -1) {
cout<<"The deleted element is: "<<value<<endl;
}
break;
case 3: q.display();
break;
case 4: break;
default: cout<<"Wrong option !\n";
break;
}
} while(option != 4);
if(option == 4) {
cout<< "\nTHANK YOU for using the program !\n"
<<"Have a good day.\n\n";
}
}