-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathCircularQueue.cpp
More file actions
71 lines (61 loc) · 742 Bytes
/
Copy pathCircularQueue.cpp
File metadata and controls
71 lines (61 loc) · 742 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
// CircularQueue
#include <iostream>
using namespace std;
class Queue
{
int *arr;
int n;
int cs;
int f;
int e;
public:
Queue(int s = 5){
cs = 0;
arr = new int[s]; //Dynamically declare
n = s;
f = 0;
e = s-1;
}
void push(int d){
if(cs == n){
cout<<"Queue overflow"<<endl;
}
else{
e = (e+1)%n; //For making cycle
arr[e] = d;
cs++;
}
}
void pop(){
if(cs==0){
cout<<"Queue underflow"<<endl;
}
else{
f = (f+1)%n;
cs--;
}
}
bool empty(){
return cs==0;
}
int size(){
return cs;
}
int front(){
return arr[f];
}
};
int main()
{
Queue q;
q.push(0);
q.push(1);
q.push(2);
q.push(3);
q.push(4);
while(!q.empty()){
cout<<q.front()<<endl;
q.pop();
}
return 0;
}