-
Notifications
You must be signed in to change notification settings - Fork 0
/
antrian.cpp
84 lines (73 loc) · 1.17 KB
/
antrian.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
#include <iostream>
using namespace std;
const int MAX = 5;
struct queue
{
string data[MAX];
int head;
int tail;
};
queue antrian;
void create()
{
antrian.head = antrian.tail = -1;
}
bool IsEmpty()
{
if (antrian.tail == -1)
{
return true;
}
else
{
return false;
}
}
bool IsFull()
{
if (antrian.tail == MAX - 1)
{
return true;
}
else
{
return false;
}
}
void Enqueue(string data)
{
if (IsEmpty())
{
antrian.head = antrian.tail = 0;
antrian.data[antrian.tail] = data;
}
else if (!IsFull())
{
antrian.tail++;
antrian.data[antrian.tail] = data;
}
else
{
cout << "Queue is full" << endl;
}
}
string Dequeue()
{
string e = antrian.data[antrian.head];
for (int i = antrian.head; i < antrian.tail; i++)
{
antrian.data[i] = antrian.data[i + 1];
}
antrian.tail--;
return e;
}
int main()
{
create();
Enqueue("Data 1");
Enqueue("Data 2");
Enqueue("Data 3");
cout << "Dequeued element: " << Dequeue() << endl;
cout << "Dequeued element: " << Dequeue() << endl;
return 0;
}