Return to Snippet

Revision: 36300
at November 20, 2010 07:22 by jakljunic


Initial Code
#define MAX_LENGHT 1000

typedef int element;

struct qu {
	elementtype elements[MAX_LENGHT];
	element front, rear;
};

typedef struct qu queue;

int AddOne(int n){
	return (n+1)%MAX_LENGHT;
}

elementtype FrontQ(queue *Q){
	        if (AddOne(Q->rear)==Q->front)
		       cout << "Red je prazan";
            else
		        return Q->elements[Q->front];
}

void EnqueueQ(elementtype x, queue *Q){
	 if (AddOne(AddOne(Q->rear))==Q->front)
        cout << "Red je vec popunjen";
	 else{
          Q->rear = AddOne(Q->rear);
          Q->elements[Q->rear] = x;
     }
}

void DequeueQ(queue *Q){
	 if (AddOne(Q->rear)==Q->front)
		cout << "Red je prazan";
	 else
		 Q->front = AddOne(Q->front);
}

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

void InitQ(queue *Q){
	 Q->rear = MAX_LENGHT-1;
	 Q->front = 0;
}

Initial URL

                                

Initial Description

                                

Initial Title
Zadatak_3_red_polje_jakljunic

Initial Tags

                                

Initial Language
C++