⑴实现循环队列各种基本运算的算法 ⑵实现链队各种基本运算的算法-Realization of basic operations of circular queue；Realization of basic operations team chain algorithm

4阶斐波那契序列如下：f0=f1=f2=0, f3=1,…,fi=fi-1+fi-2+fi-3+fi-4， 利用容量为k=4的循环队列，构造序列的前n+1项（f0, f1 , f2 ,… fn ），要求满足fn ≤200而fn+1 >200。-Fibonacci Fibonacci sequence of order 4 are: f0 = f1 = f2 = 0, f3 = 1, ..., fi = fi-1+fi-2+fi-3+fi-4, k = 4 for the capacit

缓冲器设计 。采用数组实现一16字节的循环队列，编制程序：主程序从键盘输入一个个字符插入到队列，按 - 从队列取出一个显示出来。-The array to achieve a 16 byte circular queue, the program: the main program the keyboard input one character is inserted into the queue, according to the - the queue out a show.