Advanced Search

Cekaonica i pacjenti - red_polje.h

/ Published in: C++
Save to your folder(s)
Vedran Vađunec

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. struct cekaonica{ 
  2.     int broj_pacjenta;  
  3.     int cekanje ;
  4.     int proteklo_u_ordinaciji; 
  5.     int prioritet;   
  6. };
  7.  
  8. struct red{       
  9.     cekaonica elementi[10001];  
  10.     int celo; 
  11.     int zacelje;   
  12. };
  13.  
  14. int addone(int n){
  15.     return ((n+1)%10001);
  16. };
  17.  
  18. void InitQ(red *Red){   
  19.     Red->celo=0;     
  20.     Red->zacelje=10000;     
  21. };
  22.  
  23. bool IsemptyQ(red *Red){
  24.     if(addone(Red->zacelje)==Red->celo) 
  25.     return true;
  26.     else 
  27.     return false;
  28. };
  29.  
  30. bool EnqueueQ(cekaonica x, red *Red){
  31.          Red->zacelje=addone(Red->zacelje);
  32.          Red->elementi[Red->zacelje]=x;
  33. };
  34.  
  35. void DequeueQ(red *Red){
  36.     Red->celo=addone(Red->celo);
  37. };
  38.  
  39. cekaonica FrontQ(red *Red){
  40.     return (Red->elementi[Red->celo]);
  41. };

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.