PRIORITY QUEUE

18 Apr

#include
#define maks 7

using namespace std;

class Queue{
friend ostream& operator<<(ostream&, const Queue&);
public :
Queue();
int penuh(int);
int kosong(int);
void cetak();
void enqueue(char);
char dequeue();
private :
char A[maks];
int banyak;
};

ostream& operator<<(ostream&out,const Queue& s)
{ cout<<"\nIsi Queue sebanyak : "<<s.banyak<<" yaitu ";
for(int i=0; i<s.banyak; i++)
out<< s.A[i]<< " ";
}

Queue::Queue(){
banyak=0;
for(int i=0; i<maks; i++)
A[i]='0';
}

int Queue::penuh(int s)
{ return s==maks ? 1:0;}

int Queue::kosong(int s)
{return s==0 ? 1:0;}

void Queue::cetak()
{ cout<<"\nIsi Queue : ";
for(int i=0; i<banyak; i++)
cout<<A[i]<<" ";
}

void Queue::enqueue(char x)
{
cout<<"\nElemen : "<< x <<" masuk antrian ";
if(penuh(banyak))cout=tempat; i–)
A[i+1]=A[i];
A[tempat]=x;
banyak++;
}
}

char Queue::dequeue()
{
char temp=A[–banyak];
cout< “<<temp;
A[banyak]='0';
return temp;
}

main(){
Queue p;
p.enqueue('a');
cout<<p;
p.enqueue('d');
cout<<p;
p.enqueue('c');
cout<<p;
p.enqueue('e');
cout<<p;
p.enqueue('b');
cout<<p;
p.enqueue('g');
cout<<p;
p.enqueue('f');
cout<<p;
char x=p.dequeue();
cout<<" elemen yang di dequeue "<<x<<endl;
cout<<p;
//p.enqueue('H');
//cout<<p;
{
system("PAUSE");
return EXIT_SUCCESS;
}
}

Tinggalkan Balasan

Isikan data di bawah atau klik salah satu ikon untuk log in:

Logo WordPress.com

You are commenting using your WordPress.com account. Logout / Ubah )

Gambar Twitter

You are commenting using your Twitter account. Logout / Ubah )

Foto Facebook

You are commenting using your Facebook account. Logout / Ubah )

Foto Google+

You are commenting using your Google+ account. Logout / Ubah )

Connecting to %s

%d blogger menyukai ini: