-
Notifications
You must be signed in to change notification settings - Fork 0
/
CQUEUE.CPP
136 lines (136 loc) · 2.02 KB
/
CQUEUE.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
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
#define MAX 5
int a[MAX],rear=-1,front=-1;
void enqueue(int item)
{
if(front==((rear+1)%MAX))
{
cout<<"Queue is Full\n";
}
else if(front==-1)
{
front=0;
rear=0;
a[rear]=item;
}
else
{
rear=(rear+1)%MAX;
a[rear]=item;
}
}
int dequeue()
{
int item=-1;
if(front==-1)
{
return -1;
}
else if(front==rear)
{
item=a[front];
rear=front=-1;
}
else
{
item=a[front];
front=(front+1)%MAX;
}
return item;
}
int isempty()
{
if(front==-1)
return 1;
else
return 0;
}
int isfull()
{
if(rear==MAX-1)
return 1;
else
return 0;
}
int peek()
{
if(front!=-1)
return a[front];
else
return -1;
}
void display()
{
int i;
if(front==-1)
{
cout<<"Queue is empty";
}
else
{
for(i=front;i<=rear;i++)
cout<<a[i]<<"\n";
}
if(front>rear)
{
for(i=front;i<=MAX-1;i++)
cout<<a[i]<<"\n";
for(i=0;i<=rear;i++)
cout<<a[i]<<"\n";
}
}
void main()
{
int n,item,k,loc;
char str[20];
clrscr();
while(1)
{
cout<<"\nPress 1 to enqueue\n";
cout<<"Press 2 to dequeue\n";
cout<<"Press 3 to Display\n";
cout<<"Press 4 exit\n";
cout<<"Press 5 to check empty\n";
cout<<"Press 6 to check full\n";
cout<<"Press 7 to Peek or Peep\n";
cin>>n;
switch(n)
{
case 1:
cout<<"Enter Item\n";
cin>>item;
enqueue(item);
break;
case 2: item=dequeue();
if(item==-1)
cout<<"Queue is Empty\n";
else
cout<<"Item deleted is "<<item;
break;
case 3:display();
break;
case 4:
exit(1);
break;
case 5: if(isempty())
cout<<"Queue is Empty\n";
else
cout<<"Queue is not Empty\n";
break;
case 6: if(isfull())
cout<<"Queue is Full\n";
else
cout<<"Queue is not Full\n";
break;
case 7: item=peek();
if(item==-1)
cout<<"Queue Empty";
else
cout<<"Item on front is "<<item;
break;
default: cout<<"Wrong Input";
}
}
}