-
Notifications
You must be signed in to change notification settings - Fork 0
/
circular_queue.cpp
140 lines (125 loc) · 2.22 KB
/
circular_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
#include <iostream>
#include <queue>
using namespace std;
int val, i;
class Queue
{
private:
int rear, front, queue_arr[5];
public:
Queue()
{
rear = -1;
front = -1;
for (i = 0; i < 5; i++)
{
queue_arr[i] = 0;
}
}
bool empty()
{
if (front == -1 && rear == -1)
{
return true;
}
else
{
return false;
}
}
bool full()
{
if ((rear + 1) % 5 == front)
{
return true;
}
else
{
return false;
}
}
void insert(int val)
{
if (full())
{
cout << "Circular Queue is full " << endl;
return ;
}
else if(empty())
{
front = 0;
rear = 0;
queue_arr[rear]= val;
}
else
{
rear = (rear + 1) % 5;
queue_arr[rear] = val;
}
}
int del()
{
int val =0;
if (empty())
{
cout << "Cicular Queue is Empty " << endl;
return -1;
}
else if(rear == front)
{
val = queue_arr[front];
rear = -1;
front = -1;
return val;
}
else
{
val = queue_arr[front];
rear = (rear + 1) % 5;
return val;
}
}
void display()
{
for( i=0; i<5; i++)
{
cout<<queue_arr[i]<<" ";
}
}
};
int maun()
{
Queue Q;
int val, choice;
do
{
cout << "Enter the Choice of the Operation : ";
cin >> choice;
switch (choice)
{
case 1:
{
cout << "Enter the Push Element : ";
cin >> val;
Q.insert(val);
break;
}
case 2:
{
cout << "Deleted element is " << Q.del() << endl;
break;
}
case 3:
{
Q.display();
break;
}
default:
{
cout << "Enter the valid choice" << endl;
break;
}
}
}while(choice != 0);
return 0;
}