Repository navigation
Expand file tree
/
Copy pathSimpleQueue.cpp
More file actions
133 lines (106 loc) · 2.14 KB
/
Copy pathSimpleQueue.cpp
File metadata and controls
133 lines (106 loc) · 2.14 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
125
126
127
128
129
130
131
132
#include <iostream>
using namespace std;
class Queue
{
public:
int A[6];
int front;
int rear;
Queue()
{
front = -1;
rear = -1;
}
void enqueue(int value)
{
if (rear == 5)
{
cout << "Queue is Overflow\n";
return;
}
if (front == -1)
{
front = 0;
}
rear++;
A[rear] = value;
cout << "Element " << value << " is added in queue\n";
}
void dequeue()
{
if (front == -1 || front > rear)
{
cout << "Queue is Underflow\n";
return;
}
cout << "Element " << A[front] << " deleted\n";
front++;
if (front > rear)
{
front = -1;
rear = -1;
}
}
void display()
{
if (front == -1 || front > rear)
{
cout << "Queue is Empty\n";
return;
}
cout << "Queue: ";
for (int i = front; i <= rear; i++)
{
cout << A[i] << " ";
}
cout << endl;
}
void peek()
{
if (front == -1 || front > rear)
{
cout << "Queue is Empty\n";
return;
}
cout << "Front = " << A[front] << endl;
cout << "Rear = " << A[rear] << endl;
}
};
int main()
{
Queue q;
int choice, value;
do
{
cout << "\n1. Enqueue\n";
cout << "2. Dequeue\n";
cout << "3. Display Queue\n";
cout << "4. Peek\n";
cout << "5. Exit\n";
cout << "Enter your choice: ";
cin >> choice;
switch (choice)
{
case 1:
cout << "Enter value: ";
cin >> value;
q.enqueue(value);
break;
case 2:
q.dequeue();
break;
case 3:
q.display();
break;
case 4:
q.peek();
break;
case 5:
cout << "Program ended\n";
break;
default:
cout << "Invalid choice\n";
}
} while (choice != 5);
return 0;
}