# Posted By

kresimir20 on 11/21/10

# Statistics

Viewed 365 times
Favorited by 0 user(s)

# Implementacija reda pomoÄ‡u cirkularnog polja

/ Published in: C++

Copy this code and paste it in your HTML
`#include <iostream>#include <cstring>using namespace std;struct zapis {       string preime;       int god,transakcija;       double stanje_racuna;};typedef zapis klijent;struct queue {       klijent K[1000];       int celo,zacelje;};typedef struct queue red;int AddOne(int n) {    return ((n+1)%1000);};klijent FrontQ(red *R) {        if(AddOne(R->zacelje)!=R->celo)        return R->K[R->celo];        else {             cout << "Red je prazan!" << endl;              exit(1);        }};void EnQueueQ(klijent k,red *R) {     if (AddOne(AddOne(R->zacelje))!=R->celo) {        R->zacelje=AddOne(R->zacelje);        R->K[R->zacelje]=k;     }     else {          cout << "Red je pun!" << endl;          return;      }};void DeQueueQ(red *R) {     if (AddOne(R->zacelje)!=R->celo)     R->celo=AddOne(R->celo);     else {          cout << "Red je prazan!" << endl;          return;     }};red *InitQ(red *R) {    R=new red;    R->zacelje=9999;    R->celo=0;    return R;};bool IsEmptyQ(red *R) {     if(AddOne(R->zacelje)==R->celo)     return true;     else     return false;};`