队列顺序存储（伪代码）

#define _CRT_SECURE_NO_WARNINGS 1 
#include<stdio.h>
#define MaxSize 50
typedef struct {
	int data[MaxSize];
	int front, rear;
}SqQueue;//队列的顺序存储
void InitQueue(SqQueue& Q)
{
	Q.rear = Q.front = 0;
}//初始化队列
bool isEmpty(SqQueue Q)
{
	if (Q.rear == Q.front)
		return true;
	else
		return false;
}//队判空
bool EnQueue(SqQueue& Q, int x)
{
	if ((Q.rear + 1) % MaxSize == Q.front)
		return false;
	Q.data[Q.rear] = x;
	Q.rear = (Q.rear + 1) % MaxSize;
}//入队
bool DeQueue(SqQueue& Q, int &x)
{
	if (Q.rear == Q.front)
		return false;
	x = Q.data[Q.front];
	Q.front = (Q.front + 1) % MaxSize;
	return true;
}//出队
bool IsFull(SqQueue& Q)
{
	if ((Q.rear + 1) % MaxSize == Q.front)
		return true;
	else
		return false;
}
int main()
{
	SqQueue Q;
	InitQueue(Q);
	isEmpty(Q);
	EnQueue(Q, x);
	DeQueue(Q, x);
	IsFull(Q);
}