4阶斐波那契数列算法（使用循环队列实现）

#include"head.h" #include<stdio.h> #include<stdlib.h> SqQueue* InitQueue() { SqQueue *Q=(SqQueue*)malloc(sizeof(SqQueue)); Q->base=(int*)malloc(sizeof(int)*MAXSIZE); if(!Q->base){ exit(0); } Q->front=0; Q->rear=0; Q->length=0; return Q; } void EnQueue(SqQueue *Q, int e) { if(Q->length>=MAXSIZE)return; Q->base[Q->rear]=e; Q->rear=(Q->rear+1)% MAXSIZE; Q->length++; } int Delete(SqQueue *Q) { if(Q->length==0)return 0; int e=Q->base[Q->front]; Q->front=(Q->front+1)% MAXSIZE; Q->length--; return e; }