Advanced Search

Implementacija reda pomoću pokazivača

/ Published in: C++
Save to your folder(s)

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4. struct zapis {
  5.        string preime;
  6.        int god,transakcija;
  7.        double stanje_racuna;
  8. };
  9. typedef zapis klijent;
  10. struct que {
  11.        klijent K;
  12.        que *next;
  13. };
  14. struct queue {
  15.        que *celo,*zacelje;
  16. };
  17. typedef struct queue red;
  18. klijent FrontQ(red *Q) {
  19.         if (Q->celo!=Q->zacelje)
  20.         return(Q->celo->next->K);
  21.         else {
  22.              cout << "Red je prazan!" << endl;
  23.              exit(1);
  24.         }
  25. };
  26. void EnQueueQ(klijent K,red *Q) {
  27.      que *novi=new que;
  28.      novi->K=K;
  29.      novi->next=NULL;
  30.      Q->zacelje->next=novi;
  31.      Q->zacelje=novi;
  32. };
  33. void DeQueueQ(red *Q) {
  34.      if (Q->celo!=Q->zacelje) {
  35.         que *pom=Q->celo;
  36.         Q->celo=Q->celo->next;
  37.         delete pom;
  38.      }
  39.      else {
  40.           cout << "Red je prazan!" << endl;
  41.           return;
  42.      }
  43. };
  44. queue *InitQ(red *Q) {
  45.       Q=new red;
  46.       que *novi=new que;
  47.       Q->celo=novi;
  48.       Q->zacelje=novi;
  49.       novi->next=NULL;
  50.       return Q;
  51. };
  52. bool IsEmptyQ(red *Q) {
  53.      if (Q->celo==Q->zacelje)
  54.      return true;
  55.      else
  56.      return false;
  57. };

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.