큐 랜덤 넣고 빼고

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

#define MAX_QUEUE_SIZE 10

#define MAX_SIZE 100

#define RANDOM_SIZE 30000

typedef int element;

typedef struct{

element queue[MAX_QUEUE_SIZE];

int front, rear;

}QueueType;

void error(char *message){

fprintf(stderr,"%s\n",message);

exit(1);

}

void init(QueueType *q){

q->front = q->rear = 0;

}

int is_empty(QueueType *q){

return (q->front == q->rear);

}

int is_full(QueueType *q){

return ((q->rear+1)%MAX_QUEUE_SIZE == q-> front);

}

void enqueue(QueueType *q,element item){

if( is_full(q))

error("Q is fUll");

q->rear = (q->rear + 1) % MAX_QUEUE_SIZE;

q->queue[q->rear] = item;

}

element dequeue(QueueType *q){

if (is_empty(q))

error("Q is empty");

q->front = (q->front+1) % MAX_QUEUE_SIZE;

return q->queue[q->front];

}

int main(void){

QueueType q;

int n, i, r, temp;

init(&q);

n = MAX_SIZE;

r = RANDOM_SIZE;

srand((unsigned int)time(NULL));

for( i = 0 ;i<n; i++){

temp = rand() % r;

if( temp % 2 == 0 && is_full(&q) == 0){

enqueue(&q,temp);

printf("enqueue [%d] << %d\n", i, temp);

} else if (temp % 2 == 1 && is_empty(&q) == 0){

printf("dequeue [%d] >> %d, rand : %d \n", i, dequeue(&q),temp);

}

}

}