资源列表
ListOrder
- 链表，输入一定的数据，通过链表进行储存，并排序后输出。-List。Input numbers,then output in order~~
Bitree
- 二叉树的建立，与递归遍历，并求其深度-The establishment of a binary tree, and recursively traverse and find its depth
Network-node-shortest-path
- 此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表 ，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routi
biaodashijisuan
- 数字表达式的计算，设计了两个栈（运算符及数字），简单实用-Digital expression calculation, design of the two stacks (operators and digital), simple and practical
shiyan2
- 数据结构，两个多项式的相加计算，主要运用链表-Data structures, computing the sum of two polynomials, the main use of the list
shiyan3
- 模拟银行的叫号机。在程序运行过程中使用文本菜单供用户选择，选择1则模拟储户按下叫号机取叫号纸（即入队列），选择2则模拟银行工作人员按下叫号机，请取得相应号数的储户到前台办理业务（即出队列）。叫号机的号数从1号开始往上递增。 -Simulation machine called the number of banks. The program is running for the user to choose a text menu, select a machine called the n
BiTree
- 二叉树的实现，上大一时候的作业，分享给大家-The realization of a binary tree, a freshman, when operating, for everyone to share
msort
- 实现快速排序算法，并通过对比比较算法的效率。-the program realize the quick sort function and can compare the efficiency of the algorithm
stone
- 采用可变式分区管理，首次适应算法实现内存分配和回收-Using variable partitioning management, first-fit memory allocation and recovery algorithm
triangulation
- 动态规划求解凸8边形分割，使各三角形权重和最小-Dynamic programming convex 8-gon split, so that the triangle and the minimum weight
bsearch_test
- 二分查找算法比较函数可扩展的一个测试程序-the besearch of compare function extend
kmeans
- 数据挖掘（KNN）的算法，VC实现，可以参考参考-Data Mining (KNN) algorithm, VC, and users can refer to reference