環狀佇列

#include<stdio.h>
#define max 10

int queue[max];
int fornt=-1;
int rear=-1;

int endequ(int temp)
{
    if(rear+1==fornt||(rear+1==max&&fornt<=0)) return -1;
    (rear+1==max)&&(rear=-1);
    rear++;
    queue[rear]=temp;
}
int undequ()
{
    if(fornt==rear)return-1;
    (fornt+1==max)&&(fornt=-1);
    fornt++;
    return queue[fornt];
}

int main()
{
    int select,temp,loop=1,count=-1;
    while(loop){
        printf("(1)輸入數字\n(2)取出數字\n(3)列印全部\n");
        scanf("%d",&select);
        switch(select)
        {
            case 1:
                printf("請輸入數字");
                scanf("%d",&temp);
                endequ(temp)==-1&&printf("fill\n");
                count++;
                break;
            case 2:
                ((temp=undequ())==-1)?printf("empty\n"):
                printf("take a number:%d\n",temp);
                count--;
                break;
            case 3:
                if(count<0)printf("empty\n");
                else
                    for(fornt++;fornt<=rear;fornt++)
                        printf("%d ",queue[fornt]);
                printf("\n");
                loop=0;
                break;
        }
    }
    return 0;
}