(2)循环队列的入队算法: void EnQueue (Queue *sq,int x) Rif(sq->rear+l)%MAXLEN==Sq->front) printf( queue is full!n); ese isq->rear=(sq->rear+1)%MAXLEN rear maslen=4 sq->qsq->rear=x; fE)g44=0 0 e ont 3(2) 循环队列的入队算法： void EnQueue(Queue *sq,int x) {if((sq->rear+1)%MAXLEN==sq->front) printf("queue is full!\n"); else {sq->rear=(sq->rear+1)%MAXLEN; sq->q[sq->rear]=x; } } e4 e3 rear x