Algoritma Queue :
#include <iostream>
struct QUEUE{
int data[5];
};
QUEUE antrian;
antrian.head = 0;
antrian.tail = -1;
return true;
else
return false;
if(antrian.tail == 4)
return true;
else
return false;
if(isFull() == true)
else{
int bil;
cin>>bil;
antrian.tail = antrian.tail+1;
antrian.data[antrian.tail] = bil;
if(isEmpty() == true)
else{
antrian.data[i-1] = antrian.data[i];
antrian.tail = antrian.tail - 1;
if(isEmpty() == true)
cout<<"Antrian masih KOSONG !!!"<<endl;
else{
cout<<endl;
char a;
cin>>a;
antrian.tail = - 1;
else
int pilihan;
char ulang;
inisialisasi();
do{
cout<<"=========="<<endl;
cout<<"4. Clear"<<endl;
cout<<"=========="<<endl;
cin>>pilihan;
switch(pilihan)
cin>>ulang;
return 0;
}
Algoritma STACK :
#include <iostream>
struct STACK
int data[5];
};
tumpukan.maks = 4;
tumpukan.top = -1;
if(tumpukan.top == -1)
return true;
else
return false;
if(tumpukan.top == tumpukan.maks)
return true;
else
return false;
}
if(isFull() == true)
else{
tumpukan.top = tumpukan.top + 1;
tumpukan.data[tumpukan.top] = data;
cout<<tumpukan.top<<endl;
if(isEmpty() == true)
else{
cout<<tumpukan.data[tumpukan.top]<<endl;
tumpukan.top = tumpukan.top - 1;
cout<<tumpukan.data[i]<<" ";
}
cout<<endl;
char isClear;
cin>>isClear;
tumpukan.top = -1;
else{
int pilihan;
char ulang;
inisialisasi();
do{
system("cls");
cout<<"=========="<<endl;
cout<<"2. Pop"<<endl;
cout<<"3. Print"<<endl;
cout<<"4. Clear"<<endl;
cout<<"=========="<<endl;
cin>>pilihan;
switch(pilihan)
case 1:
int data;
cin>>data;
Push(data);
break;
case 2:
Pop();
break;
case 3:
Print();
break;
case 4:
Clear();
break;
default:
{
cin>>ulang;
return 0;
}
Algoritma Lingked List :
#include<iostream>
#include<stdlib.h>
#include<conio.h>
int nr,isi,ch;
struct node
int norek;
string nama;
string alamat;
int saldo;
}*front=NULL,*rear,*temp;
void ins()
temp=new node;
string asal;
string n;
cin>>nr;
cin.ignore(1,'\n');
getline(cin,n);
getline(cin,asal);
cin>>isi;
temp->norek=nr;
temp->nama=n;
temp->saldo=isi;
temp->next=NULL;
if(front==NULL)
front=rear=temp;
else
rear->next=temp;
rear=temp;
void del()
if(front==NULL)
getch();}
else
temp=front;
front=front->next;
delete(temp);
getch();
void dis()
if(front==NULL)
getch();}
else
temp=front;
while(temp!=NULL)
cout<<" ------------------------------"<<endl;
temp=temp->next;
getch();
void cari()
node *temp;
temp=front;
int caridata;
int ketemu=0;
if(front != NULL)
cin>>caridata;
while(temp!=NULL)
temp->norek;
if(caridata==temp->norek)
cout<<" ------------------------------"<<endl;
cout<<"\n\n";
ketemu=1;
temp=temp->next;
if(ketemu==0)
getch();
void transaksi()
node *temp;
temp=front;
int ketemu=0;
if(front != NULL)
cin>>nr;
cout<<endl;
while(temp!=NULL)
temp->norek;
if(nr==temp->norek)
cobalagi:
cout<<" 1.Isi Saldo";
cin>>ch;
if(ch==1)
cin>>isi;
temp->saldo=temp->saldo+isi;
cout<<" ------------------------------"<<endl;
cout<<"\n";
ketemu=1;
}else if(ch==2)
lagi:
cin>>isi;
if(temp->saldo<isi)
goto lagi;
}else
temp->saldo=temp->saldo-isi;
cout<<" ------------------------------"<<endl;
cout<<"\n";
}
ketemu=1;
temp=temp->next;
if(ketemu==0)
getch();
void cek()
node *temp;
temp=front;
int ketemu=0;
if(front != NULL)
cin>>nr;
while(temp!=NULL)
temp->norek;
if(nr==temp->norek)
ketemu=1;
temp=temp->next;
}
if(ketemu==0)
getch();
int main()
int ch,nr,isi;
while(1)
system("cls");
cout<<"\n 3.Transaksi";
cout<<"\n 7.Keluar";
cin>>ch;
switch(ch)
case 1:
ins();
break;
case 2:
del();
break;
case 3:
transaksi();
break;
case 4:
cek();
break;
case 5:
dis();
break;
case 6:
cari();
break;
case 7:
exit(0);
break;
default:
getch();
return 0;