forked from TheAlgorithms/C-Plus-Plus
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue_using_array.cpp
More file actions
93 lines (81 loc) · 1.87 KB
/
queue_using_array.cpp
File metadata and controls
93 lines (81 loc) · 1.87 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
/*
Write a program to implement Linear Queue using array.
Functions to implement
Enqueue (Insertion)
Dequeue (Deletion)
*/
#include <iostream>
#define MAXSIZE 10
class Queue_Array {
int front;
int rear;
int size;
public:
Queue_Array() {
front = -1;
rear = -1;
size = MAXSIZE;
}
int *arr = new int[size];
void enqueue(int);
int dequeue();
void display();
};
void Queue_Array::enqueue(int ele) {
if (rear == size - 1) {
std::cout << "\nStack is full";
} else if (front == -1 && rear == -1) {
front = rear = 0;
arr[rear] = ele;
} else if (rear < size) {
rear++;
arr[rear] = ele;
}
}
int Queue_Array::dequeue() {
int d;
if (front == -1) {
std::cout << "\nstack is empty ";
return 0;
} else if (front == rear) {
d = arr[front];
front = rear = -1;
} else {
d = arr[front++];
}
return d;
}
void Queue_Array::display() {
if (front == -1) {
std::cout << "\nStack is empty";
} else {
for (int i = front; i <= rear; i++)
std::cout << arr[i] << " ";
}
}
int main() {
int op, data;
Queue_Array ob;
std::cout << "\n1. enqueue(Insertion) ";
std::cout << "\n2. dequeue(Deletion)";
std::cout << "\n3. Display";
std::cout << "\n4. Exit";
while (1) {
std::cout << "\nEnter your choice ";
std::cin >> op;
if (op == 1) {
std::cout << "Enter data ";
std::cin >> data;
ob.enqueue(data);
} else if (op == 2) {
data = ob.dequeue();
std::cout << "\ndequeue element is:\t" << data;
} else if (op == 3) {
ob.display();
} else if (op == 4) {
exit(0);
} else {
std::cout << "\nWrong choice ";
}
}
}