Advanced Search

Return to Snippet

Revision: 36288
at November 24, 2010 02:54 by redops28
Updated Code 
#include <iostream>
using namespace std;
struct red {
	tklijent klijent[1000];
	int front,rear;
};

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

tklijent FrontQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
	
		exit(0);
	}
	else
		return(Q->klijent[Q->front]);
}

void EnQueueQ(tklijent x,red *Q) {
	if (AddOne(AddOne(Q->rear))==Q->front) {
		cout << "Red je pun" << endl;
		
		exit(0);
	}
	else {
		Q->rear=AddOne(Q->rear);
		Q->klijent[Q->rear]=x;
	}
}

void DeQueueQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
		
		exit(0);
	}
	else
		Q->front=AddOne(Q->front);
}

void InitQ(red *Q) {
	Q->rear=999;
	Q->front=0;
}

int IsEmptyQ(red *Q) {
	if (AddOne(Q->rear)==Q->front)
		return(-1);
	else
		return(0);
}

Revision: 36287
at November 23, 2010 19:23 by redops28
Updated Code 
#include <iostream>
using namespace std;
struct red {
	tklijent klijent[1000];
	int front,rear;
};

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

tklijent FrontQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
	
		exit(0);
	}
	else
		return(Q->klijent[Q->front]);
}

void EnQueueQ(tklijent x,red *Q) {
	
		Q->rear=AddOne(Q->rear);
		Q->klijent[Q->rear]=x;
	
}

void DeQueueQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
		
		exit(0);
	}
	else
		Q->front=AddOne(Q->front);
}

void InitQ(red *Q) {
	Q->rear=999;
	Q->front=0;
}

int IsEmptyQ(red *Q) {
	if (AddOne(Q->rear)==Q->front)
		return(-1);
	else
		return(0);
}

Revision: 36286
at November 23, 2010 18:57 by redops28
Updated Code 
#include <iostream>
using namespace std;
struct red {
	tklijent klijent[1000];
	int front,rear;
};

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

tklijent FrontQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
	
		exit(0);
	}
	else
		return(Q->klijent[Q->front]);
}

void EnQueueQ(tklijent x,red *Q) {
	if (AddOne(AddOne(Q->rear))==Q->front) {
		cout << "Red je pun" << endl;
		
		exit(0);
	}
	else {
		Q->rear=AddOne(Q->rear);
		Q->klijent[Q->rear]=x;
	}
}

void DeQueueQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
		
		exit(0);
	}
	else
		Q->front=AddOne(Q->front);
}

void InitQ(red *Q) {
	Q->rear=999;
	Q->front=0;
}

int IsEmptyQ(red *Q) {
	if (AddOne(Q->rear)==Q->front)
		return(-1);
	else
		return(0);
}

Revision: 36285
at November 20, 2010 04:31 by redops28
Initial Code 
#include <iostream>
using namespace std;
struct red {
	tklijent klijent[1000];
	int front,rear;
};

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

tklijent FrontQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
	
		exit(0);
	}
	else
		return(Q->klijent[Q->front]);
}

void EnQueueQ(tklijent x,red *Q) {
	if (AddOne(AddOne(Q->rear))==Q->front) {
		cout << "Red je pun" << endl;
		return;
		exit(0);
	}
	else {
		Q->rear=AddOne(Q->rear);
		Q->klijent[Q->rear]=x;
	}
}

void DeQueueQ(red *Q) {
	if (AddOne(Q->rear)==Q->front) {
		cout << "Red je prazan" << endl;
		return;
		exit(0);
	}
	else
		Q->front=AddOne(Q->front);
}

void InitQ(red *Q) {
	Q->rear=999;
	Q->front=0;
}

int IsEmptyQ(red *Q) {
	if (AddOne(Q->rear)==Q->front)
		return(-1);
	else
		return(0);
}
Initial URL 









Initial Description














Initial Title





SP_Z3_red_polje.h_jz.cpp









Initial Tags














Initial Language





C++