forked from sunidhi2001/Hacktoberfest2022-accepted
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueueByArray.cpp
137 lines (122 loc) · 2.15 KB
/
QueueByArray.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
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
133
134
135
136
137
#include <iostream>
using namespace std;
int front = 0, rear = 0, n = 5;
int queue[10], item, choice;
void enqueue(int);
void dequeue();
void peek();
void print();
int main()
{
cout << "\n---Queue---\n";
cout << "1. Enqueue()" << endl;
cout << "2. Dequeue()" << endl;
cout << "3. Peek()" << endl;
cout << "4. Print()" << endl;
cout << "5. Exit()" << endl;
while (1)
{
cout << "Enter your choice : ";
cin >> choice;
switch (choice)
{
case 1:
cout << "Enter the data : ";
cin >> item;
enqueue(item);
cout << "\n";
break;
case 2:
dequeue();
break;
case 3:
peek();
break;
case 4:
print();
break;
case 5:
exit(0);
break;
default:
cout << "Wrong Input" << endl;
break;
}
}
return 0;
}
void enqueue(int data)
{
if ((front == 1 && rear == n) || (front == rear + 1))
{
cout << "Overflow \n";
return;
}
if (front == 0)
{
front = 1;
rear = 1;
}
else if (rear == n)
{
rear = 1;
}
else
{
rear = rear + 1;
}
queue[rear] = item;
return;
}
void dequeue()
{
if (front == 0)
{
cout << "Underflow \n" << endl;
return;
}
item = queue[front];
cout << item << " is deleted.\n\n";
if (front == rear)
{
front = 0;
rear = 0;
}
else if (front == n)
{
front = 1;
}
else
{
front = front + 1;
}
return;
}
void print()
{
cout << "\nData : ";
int i;
if (front <= rear)
{
for (i = front; i <= rear; i++)
{
cout << queue[i] << " ";
}
}
else
{
for (i = front; i <= n; i++)
{
cout << queue[i] << " ";
}
for (i = 1; i <= rear; i++)
{
cout << queue[i] << " ";
}
}
cout << "\n\n";
}
void peek()
{
cout << "First element is : " << queue[front] << "\n\n";
}