#include <stdio.h>
#include <stdlib.h>
#define MAX 5
typedef struct
{
int key;
}element;
int main()
{
element list[MAX];
int rear = 0;
int front = 0;
int d, err;
element tmp;
printf(" enter a data :\n");
err = scanf("%d", &d);
if (!err)
printf("read data err\n");
while ( getchar() != 'q')
{
tmp.key = d;
if (((rear+1) % MAX ) != front)
{
list[rear] = tmp;
printf("list[%d]= %d\n", rear, list[rear].key);
rear = (rear+1) % MAX;
}
else
printf("queue full\n");
printf(" enter a data :\n");
err = scanf("%d", &d);
if (!err)
printf("read data err\n");
}
while (front != rear)
{
tmp = list[front];
printf("%d\n", tmp.key);
front = (front + 1) % MAX;
}
return 0;
}
#include <stdlib.h>
#define MAX 5
typedef struct
{
int key;
}element;
int main()
{
element list[MAX];
int rear = 0;
int front = 0;
int d, err;
element tmp;
printf(" enter a data :\n");
err = scanf("%d", &d);
if (!err)
printf("read data err\n");
while ( getchar() != 'q')
{
tmp.key = d;
if (((rear+1) % MAX ) != front)
{
list[rear] = tmp;
printf("list[%d]= %d\n", rear, list[rear].key);
rear = (rear+1) % MAX;
}
else
printf("queue full\n");
printf(" enter a data :\n");
err = scanf("%d", &d);
if (!err)
printf("read data err\n");
}
while (front != rear)
{
tmp = list[front];
printf("%d\n", tmp.key);
front = (front + 1) % MAX;
}
return 0;
}