#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define size 5
#define true 1
#define false 0
int Cque[size];
int front;
int rear;
int data = 0;
void queueInit(int front, int rear);
int qIsEmpty(void);
int qIsFull(void);
int NextPosIdx(int pos);
void enqueue(int data);
int dequeue(void);
int qpeek(int Cque);
int main() {
//큐 생성 및 초기화
queueInit(front, rear);
//데이터 넣기
//enqueue(22);
//dequeue();
//enqueue(23);
//dequeue();
//enqueue(24);
//dequeue();
//enqueue(25);
//dequeue();
//enqueue(26);
//dequeue();
//enqueue(27);
//dequeue();
//enqueue(28);
//dequeue();
//데이터 꺼내기
//while (front!=rear) {
// printf("%d\n", dequeue());
//}
//printf("%d", dequeue());
}
void queueInit(int front, int rear) {
front = 0;
rear = 0;
}
//int NextPosIdx(int pos) {
//
//}
void enqueue(int data) {
if (qIsFull()) {
printf("memory error");
exit(-1);
}
else {
rear = (rear + 1) % size;
Cque[rear] = data;
}
}
int qIsFull(void) {
if ((rear + 1) % size == front) return true;
else return false;
}
int dequeue (void){
if (front ==rear) {
printf("memory error");
exit(-1);
}
else {
front = (front + 1) % size;
printf("%d", Cque[front]);
return 0;
}
}
//int qIsEmpty(void) {
// if (front == rear) return true;
// else return false;
//}