一、实验目的:
- 掌握链队列的进队和出队等基本操作;
- 掌握循环队列的进队和出队等基本操作;
- 加深对队列结构的理解,逐步培养解决实际问题的编程能力。
二、实验内容和要求:
1、编写函数,实现链式队列的基本操作;
2、编写函数,实现循环队列的基本操作。
三、源程序:
#include "stdio.h"
#include "stdlib.h"
#include "io.h"
#include "math.h"
#include "time.h"
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 11
typedef int Status;
typedef int QElemType;
typedef struct{
QElemType data[MAXSIZE];
int front;
int rear;
}SqQueue;
Status visit(QElemType item){
printf("%d",item);
return OK;
}
Status InitQueue(SqQueue *sQ){
sQ->front =0;
sQ->rear =0;
return OK;
}
Status ClearQueue(SqQueue *Q){
Q->front = Q->rear =0;
return OK;
}
Status QueueEmpty(SqQueue Q){
if(Q.front == Q.rear)
return TRUE;
else
return FALSE;
}
int QueueLength(SqQueue Q){
return (Q.rear-Q.front+MAXSIZE)%MAXSIZE;
}
Status GetHead(SqQueue Q, QElemType *e){
if(Q.front == Q.rear)
return ERROR;
*e = Q.data[Q.front];
return OK;
}
Status EnQueue(SqQueue *Q, QElemType e){
if((Q->rear+1)%MAXSIZE == Q->front)
return ERROR;
Q->data[Q->rear] =e;
Q->rear = (Q->rear +1)%MAXSIZE;
return OK;
}
Status DeQueue(SqQueue *Q, QElemType *e){
if(Q->front == Q->rear)
return ERROR;
*e = Q->data[Q->front];
Q->front = (Q->front+1)%MAXSIZE;
return OK;
}
Status QueueTraverse(SqQueue Q){
int i = Q.front;
while((i+Q.front) != Q.rear){
visit(Q.data[i]);
i=(i+1)%MAXSIZE;
}
printf("\n");
return OK;
}
int main(){
Status j;
int i=0,l;
QElemType d;
SqQueue Q;
InitQueue(&Q);
for(int i =0;i< MAXSIZE-1; i++){
EnQueue(&Q,i);
}
QueueTraverse(Q);
printf("依次出队:");
for(l=1;l<=MAXSIZE;l++)
{
DeQueue(&Q,&d);
printf("d= %d,",d);
}
return 0;
}
四、实验结果: