数据结构--队列之C数组实现

队列是一种限定操作的线性表,它只能在表的一段插入,另外一段取出.所以也称为先进先出数据结构(FIFO---First In First Out)

C代码如下:

 #include<stdio.h>
 #define maxsize 5

 typedef int ElemType;

 typedef struct queue
 {
     int head;
     int tail;
     ElemType Data[maxsize];
 }Queue;

 void InitQueue(Queue *Q)
 {
     Q->tail=;
     Q->head=;
 }

 void EnQueue(Queue *Q)
 {
     int value;
     int i;
     printf("Input Queue Value:\n");
     scanf("%d",&value);
     Q->head++;
     int len=Q->head-Q->tail;
     if(len<maxsize)
     {
         for(i=len-;i>=;i--)
             Q->Data[i+]=Q->Data[i];
     }
     Q->Data[Q->tail]=value;
     printf("\n");
 }

 void DeQueue(Queue *Q)
 {
     int len=Q->head-Q->tail-;
     Q->head=Q->head-;
     if(len<=maxsize)
     {
         printf("Out put Value:\n");
         printf("%d ",Q->Data[len]);
     }

     printf("\n");
 }

 void IsEmpty(Queue *Q)
 {
     if(Q->head==&&Q->tail==)
         printf("Queue is empty.\n");
     else
         printf("Queue is not empet.\n ");

         printf("\n");
 }

 void IsFull(Queue *Q)
 {
     if(Q->head-Q->tail>=maxsize)
         printf("Queue is Full.\n");
     else
         printf("Queue is not Full.\n");

         printf("\n");
 }

 void main()
 {
     Queue Q;
     InitQueue(&Q);
     EnQueue(&Q);
     EnQueue(&Q);
     EnQueue(&Q);
     EnQueue(&Q);
     EnQueue(&Q);
     IsEmpty(&Q);
     IsFull(&Q);

     DeQueue(&Q);
     DeQueue(&Q);
     DeQueue(&Q);
     DeQueue(&Q);
     DeQueue(&Q);
     IsEmpty(&Q);
     IsFull(&Q);
 }

结果图: