-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.cpp
More file actions
133 lines (122 loc) · 2.34 KB
/
queue.cpp
File metadata and controls
133 lines (122 loc) · 2.34 KB
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
#include <iostream>
using namespace std;
#define MAX 50
class Queue
{
int queue[MAX];
int front,rear;
public:
Queue()
{
front=-1;
rear=-1;
}
bool isfull()
{
if(rear==MAX-1)
return 1;
else
return 0;
}
bool isempty()
{
if(front==-1)
return 1;
else
return 0;
}
void enqueue(int a)
{
if(!isfull())
{
queue[++rear]=a;
if(front==-1)
front=0;
}
else
cout<<"\nQUEUE OVERFLOW";
return;
}
int dequeue()
{
if(!isempty())
{
front++;
display();
}
else if(front==rear)
{
front=rear-1;
display();
}
else
{
cout<<"\nQUEUE UNDERFLOW!";
return 0;
}
}
void display()
{
cout<<endl<<"\t\t ";
for(int i=front;i<=rear;i++)//PROBLENM
{
cout<<queue[i];
if(i!=rear)
cout<<" <-- ";
}
}
int peek()
{
if(!isempty())
cout<<queue[front];
else
cout<<"\nQUEUE EMPTY!";
}
};
int main()
{
Queue q;
int a;
do
{
cout<<"\n\nWHAT DO YOU WANT TO DO?";
cout<<"\n1.ADD ELEMENT\n2.REMOVE ELEMENT\n3.SEE FRONT ELEMENT\n4.DISPLAY QUEUE\n5.EXIT";
cout<<"\nSELECTION:";
cin>>a;
switch(a)
{
case 1:
{
cout<<"ENTER ELEMENT TO INSERT:";
int b;
cin>>b;
q.enqueue(b);
break;
}
case 2:
{
cout<<"PERFORMING DEQUEUE OPERATION:\n\t\t";
q.dequeue();
break;
}
case 3:
{
cout<<"\t\tFRONT ELEMENT:";
q.peek();
break;
}
case 4:
{
cout<<"ELEMENTS IN QUEUE:";
q.display();
break;
}
case 5:
cout<<"EXITED";
break;
default:
cout<<"INAVLID CHOICE!";
}
}while(a!=5);
return 0;
}