循环队列的出入队程序.txt

循环队列的出入队程序

#define MAXN 26
int q[MAXN];
int head=0,tail=0,tag=0; 

main()
{
int i,j,z,k,t;
int p;
printf("\nInput the number\n");
scanf("%d",&j);
printf("\nInput the number in the queue.\n");
for (i=0;i<j;i++)
{
scanf("%d",&q[i]);
z=en_queue(q[i]);
if (z==1)
{
printf("\nQueue is full!\n");
break;
}
}
p=head;
printf("\nThe queue is:\n");
while(p!=tail)
{
printf("%d ",q[p]);
p++;
}
printf("\nHow many number to be deleted:\n");
scanf("%d",&k);
for (i=0;i<k;i++)
{
z=de_queue(t);
if (z==1)
{
printf("\nThe queue is empty!\n");
break;
}
}
p=head;
while(p!=tail)
{
printf("%d ",q[p]);
p++;
}
}

en_queue(x)
int x;
{
if (tail==head&&tag==1)
return(1);
tail=(tail+1)%MAXN;
q[tail]=x;
if (tail==head)
tag=1;
return(0);
}

int de_queue(p_y)
int *p_y;
{
if (head==tail&&tag==0)
return(1);
head=(head+1)%MAXN;
*p_y=q[head];
if (head==tail)
tag=0;
return(0);
}