forked from deepanshumishra/JavaAndCPP_programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.cpp
More file actions
92 lines (86 loc) · 1006 Bytes
/
Copy pathQueue.cpp
File metadata and controls
92 lines (86 loc) · 1006 Bytes
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
#include<iostream>
using namespace std;
#define max 6
int q[max];
int r = -1,f = 0;
void enqueue()
{
int item;
if(r == max-1)
{
cout<<"queue is full."<<endl;
}
else
{
cout<<"enter number : ";
cin>>item;
q[++r] = item;
}
}
void dequeue()
{
int item;
if(r<f)
{
cout<<"queue is empty."<<endl;
}
else if(r==f)
{
item = q[f];
f = 0;
r = -1;
cout<<"Deleted item : "<<item<<endl;
}
else
{
item = q[f++];
cout<<"Deleted item : "<<item<<endl;
}
}
void display()
{
int i;
if(r<f)
{
cout<<"queue is empty."<<endl;
}
else
{
for(i=f;i<=r;i++)
cout<<q[i]<<" ";
cout<<endl;
}
}
int main()
{
int ch;
while(1)
{
cout<<"Choose : "<<endl<<"1. ENQUEUE"<<endl<<"2. DEQUEUE"<<endl<<"3. DISPLAY"<<endl<<"4. EXIT"<<endl;
cin>>ch;
switch(ch)
{
case 1 :
{
enqueue();
break;
}
case 2 :
{
dequeue();
break;
}
case 3 :
{
display();
break;
}
case 4 :
{
exit(1);
break;
}
}
}
return 0;
}