资源列表
3_hanoi
- 汉诺塔是根据一个传说形成的一个问题： 有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆： 每次只能移动一个圆盘； 大盘不能叠在小盘上面。-Tower of Hanoi is formed according to a legend a problem: There are three poles A, B, C. A rod with N (N> 1) perforated disc, the disc
2_stack
- 堆栈都是一种数据项按序排列的数据结构，只能在一端(称为栈顶(top))对数据项进行插入和删除。要点：堆，顺序随意。栈，后进先出(Last-In/First-Out)。-A data stack items are sequentially arranged in a data structure, only one end (referred to as stack (top)) to insert and delete data items. Highlights: heap, in any
ecc
- 32 比特 ecc 嵌入式 实现 代码 c代码-32-bit embedded achieve ecc
beibaowenti
- 辅助新手理解一位数组的背包问题 没有别的了 价值真的不大 -good is good oh ok how are you fine think and you
Implement-a-binary-search-tree-for-string
- Implement a binary search tree for string
C-Cmethod-for-delay-time
- C-C法求相空间重构的延迟时间,内有详细说明方法，-CC method for phase space reconstruction delay time, with detailed descr iption of methods,
tower-of-hanoi
- tower of hanio program in data structure
traversing-binary-tree
- 用于构建二叉树，并且有条件地遍历二叉树结构类型的数据，是一种常见的数据结构-it can be used to creat the binary tree,and traverse the binary tree,it s a common used data struct
jbjsf
- 卷板机算法,整个系统包含工艺，钢板材质等-Bending algorithm, the system including processes, such as steel material. . .
Graph
- 图论的各种最短路算法,竞赛用 包括dijkstra、Bellman-Ford（SPFA）、Floyd-Warshall、优先队列的应用等-A variety of graph theory shortest path algorithm, racing including dijkstra, Bellman-Ford (SPFA), Floyd-Warshall, the application of the priority queue
26
- 王道论坛 堆栈算法联系 2013考研机试指南26题-Stack algorithm benevolent Forum Contact 2013 26 questions PubMed machine test guidelines
polynomial-function
- 实现数据结构里一元多项式的功能,使用链表实现此功能。-Data structure to achieve a polynomial function