Advanced Search

Posted By

jakljunic on 11/20/10

Tagged

Versions (?)

Last Edited at 11/20/10 07:22am

Statistics

Viewed 86 times
Favorited by 0 user(s)

Zadatak_3_red_polje_jakljunic

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

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. #define MAX_LENGHT 1000
  2.  
  3. typedef int element;
  4.  
  5. struct qu {
  6. 	elementtype elements[MAX_LENGHT];
  7. 	element front, rear;
  8. };
  9.  
  10. typedef struct qu queue;
  11.  
  12. int AddOne(int n){
  13. 	return (n+1)%MAX_LENGHT;
  14. }
  15.  
  16. elementtype FrontQ(queue *Q){
  17. 	        if (AddOne(Q->rear)==Q->front)
  18. 		       cout << "Red je prazan";
  19.             else
  20. 		        return Q->elements[Q->front];
  21. }
  22.  
  23. void EnqueueQ(elementtype x, queue *Q){
  24. 	 if (AddOne(AddOne(Q->rear))==Q->front)
  25.         cout << "Red je vec popunjen";
  26. 	 else{
  27.           Q->rear = AddOne(Q->rear);
  28.           Q->elements[Q->rear] = x;
  29.      }
  30. }
  31.  
  32. void DequeueQ(queue *Q){
  33. 	 if (AddOne(Q->rear)==Q->front)
  34. 		cout << "Red je prazan";
  35. 	 else
  36. 		 Q->front = AddOne(Q->front);
  37. }
  38.  
  39. bool IsEmptyQ(queue *Q){
  40. 	if (AddOne(Q->rear)==Q->front)
  41. 	   return true;
  42. 	else
  43. 		return false;
  44. }
  45.  
  46. void InitQ(queue *Q){
  47. 	 Q->rear = MAX_LENGHT-1;
  48. 	 Q->front = 0;
  49. }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.