Revision: 36301
Initial Code
Initial URL
Initial Description
Initial Title
Initial Tags
Initial Language
at November 20, 2010 08:24 by makaniski
Initial Code
struct tklijent{
char ime[20],prez[20];
int god, stanje;
char vrsta;
};
struct tred{
tklijent elem[1000];
int p,z;
};
typedef struct tred Queue;
typedef struct tklijent element;
tred* InitQ(tred *Q){
Q = new tred;
Q -> p = 0;
Q -> z = 999;
return Q;
};
int AddOne(int n){
return ((n+1)%1000);
};
element FrontQ(tred *Q){
return Q -> elem[Q -> p];
};
void EnQueueQ(element x,tred *Q){
Q -> z = AddOne(Q -> z);
Q -> elem[Q -> z] = x;
};
void DeQueueQ(tred *Q){
Q -> p = AddOne(Q -> p);
};
bool IsEmptyQ(tred *Q){
if(AddOne(Q -> z) == Q -> p)
return true;
else
return false;
};
Initial URL
Initial Description
Initial Title
Zadatak_3_red_polje_makaniski
Initial Tags
Initial Language
C++