队-1-顺序队的基本操作

#include 
#include 
#define maxSize 8
using namespace std; 

typedef struct SqQueue{
     
	int data[maxSize];
	int front;
	int rear;
}SqQueue;

void initSqQueue(SqQueue qu){
     
	qu.front=qu.rear=0;
}

void isEmpty(SqQueue qu){
     
	if(qu.front==qu.rear)
		return 1;
	return 0;
}

int enQueue(SqQueue &qu,int x){
     
	if((qu.rear+1)%maxSize==qu.front)
		return 0;
	qu.rear = (qu.rear+1)%maxSize;
	qu.data[qu.rear] = x;
	return 1;
}

int deQueue(SqQueue &qu,int &e){
     
	if(qu.rear==qu.front)
		return 0;
	qu.front = (qu.front+1)%maxSize;
	e = qu.data[qu.front];
	return 1;
}

int main(int argc, char** argv) {
     	


	return 0;
}