ch3_squeue.c

本人讲授数据结构课程时的所写的示例程序

/*
队列的顺序实现（循环队列）
author: kk.h
date: 2006.9.27
http://www.cocoon.org.cn
*/

#define MaxSize 100
typedef int ElemType;
typedef struct {
  ElemType elem[MaxSize];
  int front,rear;
}SqQueue;

InitQueue(SqQueue* pQ)
{
  pQ->front=pQ->rear=0;
}

int EnQueue(SqQueue* pQ,ElemType e)
{
  if ((pQ->rear+1)%MaxSize == pQ->front) /* 队满 */
    return 0;
  pQ->elem[pQ->rear] = e;
  pQ->rear = (pQ->rear+1)%MaxSize;
  return 1;
}

int DeQueue(SqQueue* pQ,ElemType* pe)
{
  if (pQ->rear == pQ->front)    /* 队空 */
    return 0;
  *pe = pQ->elem[pQ->front];
  pQ->front = (pQ->front+1)%MaxSize;
  return 1;
}

main()
{
  SqQueue Q;
  ElemType e;

  InitQueue(&Q);

  e=2;
  EnQueue(&Q,e);
  e=5;
  EnQueue(&Q,e);
  e=3;
  EnQueue(&Q,e);

  while(DeQueue(&Q,&e)){
    printf("\n%d",e);
  }
  getch();
}