循环队列-数组实现队列ADT

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 100
typedef int QElemType;
typedef int Status;
#define OK 1
#define ERROR 0
typedef struct{                     //结构体定义
    QElemType data[MAXSIZE];
    int front;
    int rear;
}SqQueue;

Status InitQueue(SqQueue* Q){       //初始化队列
    Q->front=0;
    Q->rear=0;
    return OK;
}

int QueueLength(SqQueue* Q){
    return (Q->rear-Q->front+MAXSIZE)%MAXSIZE;
}

Status EnQueue(SqQueue* Q,QElemType e){
    if((Q->rear+1)%MAXSIZE==Q->front)       //队列满
        return ERROR;
    Q->data[Q->rear]=e;
    Q->rear=(Q->rear+1)%MAXSIZE;    //rear指针后移，如果移到最后，则抓到数组头部
    return OK;
}

Status DeQueue(SqQueue* Q,QElemType* e){
    if(Q->front==Q->rear)       //队列为空
        return ERROR;
    *e=Q->data[Q->front];
    Q->front=(Q->front+1)%MAXSIZE;
    return OK;
}

Status PrintQueue(SqQueue* Q){
    if(Q->front<=Q->rear){
        for(int i=Q->front;i<Q->rear;i++)
            printf("%d ",Q->data[i]);
    }
    else{
        for(int i=Q->front;i<MAXSIZE;i++){
            printf("%d ",Q->data[i]);
        }
        for(int i=0;i<Q->rear;i++){
            printf("%d ",Q->data[i]);
        }
    }
    return OK;
}

int main(void){
    SqQueue* Q=malloc(sizeof(SqQueue));
    int data;
    InitQueue(Q);
    printf("Enqueue 10 elements\n");
    for(int i=0;i<10;i++){
        EnQueue(Q,rand()%100+1);
    }
    PrintQueue(Q);
    printf("\nout Queue 5 elements\n");
    for(int i=0;i<5;i++){
        DeQueue(Q,&data);
        printf("%d ",data);
    }
    printf("\n");
    PrintQueue(Q);
    return 0;
}