Data-structure/queue_using_circular_array.cpp at master · Bhanups123/Data-structure · GitHub

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
#include<iostream>
using namespace std;
#define MAX 5

int queue[MAX];
int front=-1;
int rear=-1;

bool isempty(){
	if(front==-1 && rear==-1)
		return true;
	return false;
}
void enqueue(int data){
	if(isempty()){
		front = rear = 0;
	}
	else if((rear+1)%MAX == front){
		cout<<"overflow"<<endl;
		return;
	}
	else{
		rear = (rear+1)%MAX;
	}
	queue[rear]=data;
}
void dequeue(){
	if(isempty()){
		cout<<"underflow"<<endl;
		return;
	}
	else if(front==rear){
		queue[front]=0;
		front = rear = -1;
	}
	else{
		queue[front]=0;
		front = (front+1)%MAX;
	}
}
void front_show(){
	cout<<queue[front]<<endl;
}
void print(){
	for(int i=0;i<MAX;i++)
		cout<<queue[i]<<"\t";
	cout<<endl;
}
int main(){
	enqueue(1);
	enqueue(2);
	enqueue(3);
	enqueue(4);
	enqueue(5);
	print();
	dequeue();
	print();
	enqueue(6);
	print();
	enqueue(7);
	print();
	for(int i=0;i<=MAX;i++)
	dequeue();
	print();
}