typedef struct
{
int data[MAX];
int head;
int tail;
}sqQueue;
/*顺序队列基本操作函数定义部分*/
//顺序队列的初始化函数sqInitialize()
sqQueue *sq_Initialize()
{
sqQueue *p;
p = (sqQueue *)malloc(sizeof(sqQueue));
if(p==NULL)
{
return(NULL);
}
else
{
p->data[0] = 0;
p->head = 0;
p->tail = 0;
return(p);
}
}
//顺序队列的判空函数qIsEmpty()
int qIsEmpty(sqQueue *queue)
{
if(queue->head==queue->tail)
return(1);
else
return(0);
}
//顺序队列的判满函数qIsFull()
int qIsFull(sqQueue *queue)
{
if(queue->head==MAX)
return(1);
else
return(0);
}
//顺序队列的入队函数qInQueue()
int qInQueue(sqQueue *queue,int data)
{
if(queue->tail==MAX)
{
printf("队列已满!/n");
return(0);
}
else
{
queue->data[queue->tail++] = data;
return(1);
}
}
//顺序队列的出队函数qOutQueue()
int qOutQueue(sqQueue *queue,int *p)
{
if(queue->head==queue->tail)
{
printf("队列已空!/n");
return(0);
}
else
{
*p = queue->data[queue->head++];
return(1);
}
}
//顺序队列的数据入队操作函数qInputValue()
void qInputValue(sqQueue *queue,int array[])
{
int i=0;
while(qInQueue(queue,array[i]))
printf("Queue[%d] = %c/t",i,array[i++]);
}
//顺序队列的数据出队操作函数qOutputValue()
void qOutputValue(sqQueue *queue)
{
int i,QueueData;
i=0;
while(qOutQueue(queue,&QueueData))
printf("Queue[%d] = %c/t",i++,QueueData);
printf("/n");
}