Data-Structures/src-cpp/CircularQueue.cpp at master · diptangsu/Data-Structures · 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
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
#include<bits/stdc++.h>
usingnamespacestd;

structQueue
{
// Initialize front and rear
int rear, front;

// Circular Queue
int size;
int *arr;

Queue(int s)
	{
	front = rear = -1;
	size = s;
	arr = newint[s];
	}

voidenQueue(int value);
intdeQueue();
voiddisplayQueue();
};


/* Function to create Circular queue */
voidQueue::enQueue(int value)
{
if ((front == 0 && rear == size-1) ||
 (rear == (front-1)%(size-1)))
	{
printf("\nQueue is Full");
return;
	}

elseif (front == -1) /* Insert First Element */
	{
 front = rear = 0;
 arr[rear] = value;
	}

elseif (rear == size-1 && front != 0)
	{
 rear = 0;
 arr[rear] = value;
	}

else
	{
 rear++;
 arr[rear] = value;
	}
}

// Function to delete element from Circular Queue
intQueue::deQueue()
{
if (front == -1)
	{
printf("\nQueue is Empty");
returnINT_MIN;
	}

int data = arr[front];
	arr[front] = -1;
if (front == rear)
	{
 front = -1;
 rear = -1;
	}
elseif (front == size-1)
 front = 0;
else
 front++;

return data;
}

// Function displaying the elements
// of Circular Queue
voidQueue::displayQueue()
{
if (front == -1)
	{
printf("\nQueue is Empty");
return;
	}
printf("\nElements in Circular Queue are: ");
if (rear >= front)
	{
for (int i = front; i <= rear; i++)
printf("%d ",arr[i]);
	}
else
	{
for (int i = front; i < size; i++)
printf("%d ", arr[i]);

for (int i = 0; i <= rear; i++)
printf("%d ", arr[i]);
	}
}

intmain()
{
	Queue q(5);

	q.enQueue(14);
	q.enQueue(22);
	q.enQueue(13);
	q.enQueue(-6);


	q.displayQueue();


printf("\nDeleted value = %d", q.deQueue());
printf("\nDeleted value = %d", q.deQueue());

	q.displayQueue();

	q.enQueue(9);
	q.enQueue(20);
	q.enQueue(5);

	q.displayQueue();

	q.enQueue(20);
return0;
}