-
Notifications
You must be signed in to change notification settings - Fork 0
/
regular_queue.cpp
77 lines (62 loc) · 1.28 KB
/
regular_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
#include<iostream>
using namespace std;
int n=20; // global variable
class queue{
int* arr;
int front;
int back;
public:
queue(){
arr = new int[n];
front =-1;
back =-1;
}
void enqueue(int x){
if(back==n-1){
cout<<"Queue overflow"<<endl;
return;
}
back++;
arr[back]=x;
if(front==-1){
front++;
}
}
void dequeue(){
if(front==-1 || front>back){
cout<<"no more elements present :"<<endl;
return;
}
front++;
}
int q_front(){
if(front==-1 || front>back){
cout<<"no elements in queue :"<<endl;
return -1;
}
return arr[front];
}
bool empty(){
if(front==-1 || front>back){
return true;
}
return false;
}
};
int main(){
queue q;
q.enqueue(1);
q.enqueue(2);
q.enqueue(3);
q.enqueue(4);
cout<<q.q_front()<<endl;
q.dequeue();
cout<<q.q_front()<<endl;
q.dequeue();
cout<<q.q_front()<<endl;
q.dequeue();
cout<<q.q_front()<<endl;
q.dequeue();
cout<<q.empty();
return 0;
}