搜索资源列表
northwest_wolf_Utility
- 一些实用工具类，包括智能指针、循环队列、同步队列、环状缓冲区、线程模型等。-some practical tool categories, including smart pointer, cyclic queue, queue synchronous, circular buffer, thread model.
duilie
- ⑴实现循环队列各种基本运算的算法 ⑵实现链队各种基本运算的算法-Realization of basic operations of circular queue；Realization of basic operations team chain algorithm
Que
- 定义循环队列，完成队列的基本操作：入队和出队等-Defined circular queue, the queue to complete the basic steps: into the team and the teams
1111
- 偏移实现循环队列，输出若干数据并入队，输出出对序列到队空-Offset circular queue output certain data incorporated into the team, and output a sequence to the team empty
panduanzhongxinduicheng
- 假设以带头结点的循环链表表示队列，并且只设一个指针指向对尾结点，不设头指针，试设计相应的置队空、入队和出队的程序。-Assumed to take the lead in the circular linked list of nodes to the queue, and allowed only a pointer to the node-to-tail, no head pointer, try to design the home team empty, enqueue and dequ
12
- 循环队列的实现和运算<<实用数据结构基础（第三版>>-The realization and operators of the circular queue
fibonaccique
- 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
lisnkedlist
- It is a linked list class with and without head nodes. singly linked list and doubly linked list and a circular linked list. it has queue and stack. All classes are template class.
circularQ
- Circular Queue example
recursive
- 缓冲器设计 。采用数组实现一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.