c 대기 열의 순서 저장 실현

//
//  QUEUE.c
//  duizhanduilie
//
//          

#include 
#define M 100
#define QElemType int
//     
void INITIALQ(int front,int rear);
//        
int EMPTYQ(int front,int rear);
//    
int ADDQ(QElemType QUEUE[],int rear,QElemType item);
//      
int POP(QElemType QUEUE[],int front,int rear,QElemType item);
void print(QElemType QUEUE[],int front,int rear);
int main(){
    QElemType queue[M];
    int front,rear;
    INITIALQ(front,rear);
    for(int i=1;i<=5;i++){
        rear = ADDQ(queue,rear,i);
    }
    printf(" queue     
");
    print(queue,front,rear);
    printf(" queue delete  
");
    for(int i=1;i<=5;i++){
         front = POP(queue,front,rear,i);
    }
    print(queue,front,rear);
}

//     
void INITIALQ(int front,int rear){
    front=-1;
    rear=-1;
}
//        
int EMPTYQ(int front,int rear){
    return front==rear;
}
//    
int ADDQ(QElemType QUEUE[],int rear,QElemType item){
    if(rear == M-1){//  
        return 0;
    }else{
        QUEUE[rear++]=item;
        return rear;
    }
}
//      
int POP(QElemType QUEUE[],int front,int rear,QElemType item){
    if(EMPTYQ(front,rear)){
        return 0;
    }else{
        item = QUEUE[++front];
        return front;
    }
}
void print(QElemType QUEUE[],int front,int rear){
    for(int i=front;i<=rear;i++){
        printf("%d\t",QUEUE[i]);
    }
}