-
Notifications
You must be signed in to change notification settings - Fork 0
/
dequeueArray.cpp
126 lines (124 loc) · 2.01 KB
/
dequeueArray.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
#include <iostream>
#include <stdio.h>
using namespace std;
#define MAX 6
class dequeueArray
{
private:
int capacity;
int rear;
int front;
int *ptr;
int dequeue[MAX];
public:
dequeueArray();
~dequeueArray();
void insertAtRear(int);
bool isEmpty();
bool isFull();
void insertAtFront(int);
void deleteAtFront();
void deleteAtBack();
int getFront();
int getRear();
};
int dequeueArray::getFront()
{
if (isEmpty())
{
cout << "Underflow\n";
return -1;
}
return dequeue[front];
}
int dequeueArray::getRear()
{
if (isEmpty())
{
cout << "Underflow\n";
return -1;
}
return dequeue[rear];
}
void dequeueArray::deleteAtFront()
{
if (isEmpty())
{
cout << "underflow";
return;
}
if (front == rear)
front = rear = -1;
if (front == MAX - 1)
front = 0;
else
front++;
}
void dequeueArray::deleteAtBack()
{
if (isEmpty())
{
cout << "Underflow\n";
return;
}
if (front == rear)
front = rear = -1;
else if (rear == 0)
{
rear = MAX - 1;
}
else
rear--;
}
void dequeueArray::insertAtFront(int data)
{
if (isFull())
{
cout << "Dequeue is Full\n";
return;
}
if (front == -1)
{
front = 0;
rear = 0;
}
else if (front == 0)
{
front = MAX - 1;
}
else
front--;
dequeue[front] = data;
}
void dequeueArray::insertAtRear(int data)
{
if (isEmpty())
front = rear = 0;
if (isFull())
{
cout << "dequeue is FULL\n";
return;
}
else if (rear = MAX - 1)
rear = 0;
else
rear++;
dequeue[rear] = data;
}
bool dequeueArray::isFull()
{
return front == 0 && rear == MAX - 1 || rear == front - 1;
}
bool dequeueArray::isEmpty()
{
return rear == -1;
}
dequeueArray::dequeueArray()
{
front = rear = -1;
ptr = dequeue;
}
dequeueArray::~dequeueArray()
{
delete[]ptr;
}