Linked List Bank
#include
#include
#include
#define MAX 100
typedef struct data_nasabah
{
int id; //primary key
char dtg[MAX];
char brgkt[MAX];
struct data_nasabah *next;
} data;
void judul(void)
{
puts("=============");
puts("== ANTRIAN ==");
puts("=============");
}
data *p, *h, *t, *j, *t1, *t2, *j1, *j2;
int pil, i, n, check=1, cek, jml_dt=0;
void menu(void)
{
puts("");
puts("==================");
puts("== MENU PILIHAN ==");
puts("== 1. Insert ==");
puts("== 2. Edit ==");
puts("== 3. Search ==");
puts("== 4. Hapus ==");
puts("== 5. Show ==");
puts("== 6. EXIT ==");
puts("==================");
puts("");
}
void input(void)
{
p->id = n;
fflush(stdin);
printf("Waktu datang = ");
fgets(p->dtg, sizeof p->dtg, stdin);
fflush(stdin);
printf("Waktu Berangkat = ");
fgets(p->brgkt, sizeof p->brgkt, stdin);
}
void tampil(void)
{
if(jml_dt == 0)
{
printf("\nMaaf, Data kosong...\n\n");
}
else
{
j = h;
i = 0;
printf("\n Rincian data :\n");
while(i < id =" %d\n">id);
printf("+Datang = %s", j->dtg);
printf("+Berangkat = %s\n", j->brgkt);
j = j->next;
i++;
puts("");
}
}
}
void search(void)
{
// mulai cek id
i=0;
j=h;
j1=h; // digunakan untuk menu delete
cek=0; // dengan asumsi 0 = data belum sama (1 = data sudah ada)
while(i <>id == n)
{
cek = 1;
break;
}
i++;
j1=j;
j=j->next;
}
//selesai cek id
}
void tambah(void)
{
if(jml_dt == 0)
free(p);
p = (data*) malloc (sizeof(data));
ulang :
printf("\nMasukkan ID = ");
scanf("%d", &n);
search();
if(cek == 1)
{
printf("\nData sudah ada... \n\n");
goto ulang;
}
input();
if(jml_dt == 0) //jika data masih kosong
{
jml_dt++;
p->next=NULL;
h=p;
t=p;
}
else
{
jml_dt++;
h->next=p;
p->next=NULL;
t=p;
}
}
void hapus(void)
{
if(jml_dt == 0) //jika data kosong
{
printf("\nMaaf, belum ada data...\n\n");
}
else
{
ulangg :
printf("\nNomer ID yang akan dihapus = ");
scanf("%d", &n);
search();
if(cek == 1) //data ditemukan
{
jml_dt--;
if(h->next = NULL) //jika data tinggal 1
{
h=h->next;
free(j);
j=NULL;
p = (data*) malloc (sizeof(data));
}
else if(h->id == j->id) //jika delete awal
{
h=h->next;
free(j);
j=NULL;
}
else if(t->id == j->id)//jika data akhir
{
t=j1;
t->next=NULL;
j=NULL;
}
else //jika ditengah2
{
j1->next = j->next;
free(j);
j=NULL;
}
}
else
{
printf("\nData TIDAK ada... \n\n");
goto ulangg;
}
}
}
void edit(void)
{
fflush(stdin);
if(jml_dt == 0) //jika data kosong
{
printf("\nMaaf, belum ada data...\n\n");
}
else
{
fflush(stdin);
ulangii :
printf("\nMasukkan Nomer ID = ");
scanf("%d", &n);
fflush(stdin);
search();
if(cek == 1)
{
fflush(stdin);
j2 = j;
fflush(stdin);
printf("\nDATA DITEMUKAN..!!!\n\n");
ulangiii :
fflush(stdin);
printf("Nomer ID baru = ");
scanf("%d", &n);
search();
if(cek == 1)
{
printf("\nData sudah ada... \n\n");
goto ulangiii;
}
else
{
j2->id = n;
fflush(stdin);
printf("Waktu datang = ");
fgets(j2->dtg, sizeof j2->dtg, stdin);
fflush(stdin);
printf("Waktu Berangkat = ");
fgets(j2->brgkt, sizeof j2->brgkt, stdin);
}
}
else
{
printf("\nData TIDAK ada... \n\n");
goto ulangii;
}
}
}
void search_tampil(void)
{
fflush(stdin);
if(jml_dt == 0) //jika data kosong
{
printf("\nMaaf, belum ada data...\n\n");
}
else
{
ulangii :
printf("\nMasukkan Nomer ID = ");
scanf("%d", &n);
search();
if(cek == 1)
{
//menampilkan data sesuatu data
printf("+Nomer ID = %d\n", j->id);
printf("+Datang = %s", j->dtg);
printf("+Berangkat = %s\n", j->brgkt);
}
else
{
printf("\nData TIDAK ada... \n\n");
goto ulangii;
}
}
}
main()
{
p = (data*) malloc (sizeof(data));
judul();
menu :
fflush(stdin);
menu();
printf("Pilhan anda (1-6) = ");
scanf("%d", &pil);
switch(pil)
{
case 1 :
tambah();
break;
case 2 :
edit();
break;
case 3 :
search_tampil();
break;
case 4 :
hapus();
break;
case 5 :
tampil();
break;
case 6 :
printf("\nThanks for using this program ...\n\n");
exit(0);
break;
default :
printf("\nPilihan tidak ada ...\n\n");
goto menu;
}
goto menu;
}
