forked from arpande214/programs
-
Notifications
You must be signed in to change notification settings - Fork 0
/
circular_queue2.cpp
92 lines (90 loc) · 1.89 KB
/
circular_queue2.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
#include <iostream>
#include <climits>
#define SIZE 5
using namespace std;
class Queue{
private:
int arr[SIZE];
int front;
int rear;
public:
Queue(){
front = 0;
rear = 0;
}
bool isFull(){
return ((rear+1)%SIZE==front);
}
bool isEmpty(){
return (front==rear);
}
void enque(int element){
if(isFull()){
cout<<"Queue is Full"<<endl;
return;
}
rear = (rear+1)%SIZE;
arr[rear]=element;
cout<<"Pushed "<<element<<endl;
}
void deque(){
if(isEmpty()){
cout<<"Queue is already Empty"<<endl;
return;
}
front = (front+1)%SIZE;
cout<<"Popped "<<arr[front]<<endl;
return;
}
int peek(){
if(isEmpty()){
cout<<"Queue is already empty. Nothing to display"<<endl;
return INT_MIN;
}
return arr[(front+1)%SIZE];
}
void display(){
if(isEmpty()){
cout<<"Queue is already Empty"<<endl;
return;
}
for(int i = front; i != rear; i=(i+1)%SIZE){
cout<<arr[(i+1)%SIZE]<<" ";
}
cout<<endl;
return;
}
};
int main() {
Queue q;
cout<<q.peek()<<endl; //-2147483648
cout<<q.isEmpty()<<endl; //1
cout<<q.isFull()<<endl; //0
q.deque(); //Queue is empty
q.display(); ////Queue is empty
q.enque(5);
q.enque(6);
q.enque(7);
q.enque(8);
q.enque(9);
q.display(); //5 6 7 8
cout<<q.isFull()<<endl;//1
q.deque(); //5
q.deque(); //6
cout<<q.peek()<<endl; //7
q.deque(); //7
cout<<q.peek()<<endl; //8
q.enque(2); // 2
q.enque(3); // 3
q.enque(4); // 4
q.enque(5); // Overflow
q.display();
q.deque();
q.deque();
q.display();
q.enque(2); // 2
q.enque(3); // 3
q.enque(4);
q.display();
return 0;
}