-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue_using_circular-array.cpp
More file actions
124 lines (104 loc) · 2.31 KB
/
Copy pathQueue_using_circular-array.cpp
File metadata and controls
124 lines (104 loc) · 2.31 KB
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
#include <bits/stdc++.h>
using namespace std;
class Queue
{
private:
int front;
int rear;
int capacity;
int *queue;
public:
Queue(int cap)
{
front = rear = -1;
capacity = cap;
queue = new int[capacity];
}
bool isEmpty()
{
if (rear == front)
return true;
return false;
}
bool isFull()
{
if ((rear + 1) % capacity == front)
return true;
return false;
}
void enQueue()
{
if (isFull())
cout << "\nQueue is full." << endl;
else
{
int data;
cout << "\nEnter data to be inserted : ";
cin >> data;
if (rear == -1 and front == -1)
front = 0;
rear = (rear + 1) % capacity;
queue[rear] = data;
}
}
void deQueue()
{
if (isEmpty())
cout << "\nQueue is empty." << endl;
else
{
int data = queue[front];
front = (front + 1) % capacity;
cout << endl
<< data << " is deleted from queue." << endl;
}
}
void display()
{
int i;
if (isEmpty())
cout << "\nQueue is empty." << endl;
else
{
cout << "\nElements in Circular Queue are: " << endl;
for (i = front; i != rear; i = (i + 1) % capacity)
cout << queue[i] << endl;
cout << queue[rear] << endl;
}
}
};
int main()
{
int choice, cap;
cout << "Enter capacity of the queue : ";
cin >> cap;
Queue queue(cap);
while (1)
{
cout << endl;
cout << "1. To enter data into queue." << endl;
cout << "2. To delete data from queue." << endl;
cout << "3. To display the data." << endl;
cout << "4. TO EXIT." << endl;
cout << "\nENTER YOUR CHOICE... : ";
cin >> choice;
switch (choice)
{
case 1:
queue.enQueue();
break;
case 2:
queue.deQueue();
break;
case 3:
queue.display();
break;
case 4:
exit(0);
break;
default:
cout << "\nINVALID CHOICE..." << endl;
}
}
return 0;
}