Advanced Search

Return to Snippet

Revision: 36464
at November 22, 2010 04:34 by Frenki
Updated Code 
#include<iostream>
using namespace std;

struct data {
       int godina, racun; 
       char ime_prezime[50], *transakcija;
};

data greska={0,0,'\0','\0'};

struct elementi {
       data element;
       elementi *sljedeci;       
};

struct red {
       elementi *front, *rear;       
};

void InitQ(red *Q) {
     elementi *el = new elementi;
     el->sljedeci=NULL;
     Q->front=el;
     Q->rear=el;
}

bool IsEmptyQ(red *Q) {
     if (Q->front==Q->rear) return true;
     return false;     
}

data FrontQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return greska;
     }
     return Q->front->sljedeci->element;     
}

void EnQueueQ(data x, red *Q) {
     elementi *el = new elementi;
     el->element = x;
     el->sljedeci=NULL;
     Q->rear->sljedeci=el;
     Q->rear=el;
}

void DeQueueQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return;
     }
     elementi *tekuci=Q->front;
     Q->front=Q->front->sljedeci;
     delete tekuci;     
}

Revision: 36463
at November 22, 2010 04:30 by Frenki
Initial Code 
#include<iostream>
using namespace std;

struct data {
       int godina, racun; 
       char ime_prezime[50], *transakcija;
};

data greska={0,0,'\0','\0'};

struct elementi {
       data element;
       elementi *sljedeci;       
};

struct red {
       elementi *front, *rear;       
};

void InitQ(red *Q) {
     elementi *el = new elementi;
     el->sljedeci=NULL;
     Q->front=el;
     Q->rear=el;
}

bool IsEmptyQ(red *Q) {
     if (Q->front==Q->rear) return true;
     return false;     
}

data FrontQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return greska;
     }
     return Q->front->sljedeci->element;     
}

void EnQueueQ(data x, red *Q) {
     elementi *el = new elementi;
     el->element = x;
     el->sljedeci=NULL;
     Q->rear->sljedeci=el;
     Q->rear=el;
}

void DeQueueQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return;
     }
     elementi *tekuci=Q->front;
     Q->front=Q->front->sljedeci;
     delete tekuci;     
}
#include<iostream>
using namespace std;

struct data {
       int godina, racun; 
       char ime_prezime[50], *transakcija;
};

data greska={0,0,'\0','\0'};

struct elementi {
       data element;
       elementi *sljedeci;       
};

struct red {
       elementi *front, *rear;       
};

void InitQ(red *Q) {
     elementi *el = new elementi;
     el->sljedeci=NULL;
     Q->front=el;
     Q->rear=el;
}

bool IsEmptyQ(red *Q) {
     if (Q->front==Q->rear) return true;
     return false;     
}

data FrontQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return greska;
     }
     return Q->front->sljedeci->element;     
}

void EnQueueQ(data x, red *Q) {
     elementi *el = new elementi;
     el->element = x;
     el->sljedeci=NULL;
     Q->rear->sljedeci=el;
     Q->rear=el;
}

void DeQueueQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return;
     }
     elementi *tekuci=Q->front;
     Q->front=Q->front->sljedeci;
     delete tekuci;     
}
Initial URL 









Initial Description














Initial Title





red_pokazivac.h









Initial Tags














Initial Language





C++