队列（一）循环队列的线性存储

#include<stdio.h>
#define false 0
#define ok 1
#define maxsize 5

//定义一个队列结构
typedef struct sqqueue
{
    int data[maxsize];
    int front,rear;
}sqqueue;

//建立一个空队列
void initqueue(sqqueue *l)
{
    l->front = 0;
    l->rear = 0;
}

//向队列插入元素
int inqueue(sqqueue *l, int e)
{
    if ((l->rear + 1) % maxsize == l->front)   
    return false;
    l->data[l->rear] = e;
    l->rear = (l->rear + 1) % maxsize;
    return ok;
}

//从队列出元素
int outqueue(sqqueue *l, int *e)
{
    if (l->rear == l->front)
        return false;
    *e = l->data[l->front];
    l->front=(l->front + 1) % maxsize;
    return ok;
}

//查看队列所有元素
void seequeue(sqqueue l)
{
    while (l.rear!= l.front)
    {
        printf("%4d", l.data[l.front]);
        l.front = (l.front + 1) % maxsize;
    }
}

int main(void)
{
    int i,a=0;
    sqqueue s;
    initqueue(&s);
    for(i=1;i<maxsize;i++)
    inqueue(&s, i);
    seequeue(s);
    for (i = 1; i < maxsize - 1; i++)
    {
        outqueue(&s, &a);
        printf("a=%d", a);
    }
    inqueue(&s, 5);
    inqueue(&s, 6);
    seequeue(s);
    return 0;
}

队列由数据，头，尾组成，循环队列节省了空间。
循环队列空：front==rear
循环队列满：（rear+1）%maxsize==front