tutorial_cpp/Tutorial2/21.queue.cpp at master · Fliw/tutorial_cpp · GitHub

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
#include<iostream>
#include<cstdlib>
#defineMAX10

usingnamespacestd;
structantrianSembako{
int data[MAX];
 string penerima[MAX];
int head;
int tail;
} antrian;
voidinit();
boolisKosong();
boolisPenuh();
voidshowData();
voidenqueue();
voiddequeue();
intmain(){
int pilihan;
 awal:
 cout<<"Menu Sembako\n";
 cout<<"++++++++++++\n";
 cout<<"1.Buat Antrian Sembako\n";
 cout<<"2.Tambah Penerima Sembako yang akan mengambil\n";
 cout<<"3.Hapus Penerima Sembako Yang Telah Mengambil\n";
 cout<<"4.Lihat Antrian Sekarang\n";
 cout<<"5.keluar\n";
 cout<<"++++++++++++\n";
 cout<<"Pilihan Anda =";
 cin>>pilihan;
switch (pilihan)
 {
case1:
init();
goto awal;
break;
case2:
enqueue();
goto awal;
break;
case3:
dequeue();
goto awal;
break;
case4:
showData();
goto awal;
break;
case5 :
break;
default:
 cout<<"Pilihan Anda Salah!";
break;
 }
}
voidinit(){
 antrian.head=0;
 antrian.tail=0;
system("cls");
 cout<<"antrian berhasil dibuat !\n";
}
boolisKosong(){
if(antrian.tail==0){
returntrue;
 }
else{
returnfalse;
 }
}
boolisPenuh(){
if(antrian.head==MAX){
returntrue;
 }
else{
returnfalse;
 }
}
voidshowData(){
system("cls");
if(!isKosong()){
for(int x = antrian.head;x<antrian.tail;x++){
 cout<<x+1<<". Nomor Antrian = "<<antrian.data[x]<<" Atas Nama = "<<antrian.penerima[x]<<endl;
 }
 }
else{
 cout<<"data kosong !\n";
 }
 cout<<endl;
}
voidenqueue(){
if(!isPenuh()){
int baru;
 cout<<"Masukkan Nomor Penerima Bantuan Sembako = ";
 cin>>baru;
 string nama;
 cout<<"Masukkan Nama Penerima bantuan Sembako = ";
 cin>>nama;
 antrian.data[antrian.tail]=baru;
 antrian.penerima[antrian.tail]=nama;
 antrian.tail++;
showData();
system("cls");
 cout<<"Data Telah Ditambahkan\n";

 }
else{
system("cls");
 cout<<"Antrian sudah penuh\n";
 }
}
voiddequeue(){
if(!isKosong()){
system("cls");
 cout<<"menghapus penerima sembako nomor "<<antrian.data[antrian.head]<<" atas nama "<<antrian.penerima[antrian.head]<<endl;
for(int x=antrian.head;x<antrian.tail;x++){
 antrian.data[x]=antrian.data[x+1];
 antrian.penerima[x]=antrian.penerima[x+1];
 }
 antrian.tail--;
 }
else{
system("cls");
 cout<<"Antrian Kosong !\n";
 }
}