-
example-program
里面有50例经典算法，其中包括水仙花素，兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)
- 2013-02-03 11:14:12下载
- 积分：1
-
work_std
工作时单元功能实现的部分资料
主要涉及字符串处理、排序算法，字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
- 2007-01-23 08:57:38下载
- 积分：1
-
bstree_frame
利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
- 2013-08-10 16:43:50下载
- 积分：1
-
labyrinth
迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
- 2010-12-19 23:31:36下载
- 积分：1
-
DataStructureTest
数据结构的一些基本的相关的试验，如二叉树的遍历，打印，如排序算法，检索算法，动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)
- 2009-01-20 13:18:22下载
- 积分：1
-
太阳能电池参数计算器 升级版
太阳能电池参数计算，可以快速方便计算电流，电压，填充因子等参数(Solar cell parameter calculation)
- 2017-11-23 21:30:46下载
- 积分：1
-
add-sub
实现了多项式的创建，实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)
- 2011-08-15 17:34:46下载
- 积分：1
-
最短路径c++语言
说明： 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)
- 2020-09-20 14:07:55下载
- 积分：1
-
heapsort
说明： 从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分：1
-
sort-algorithm-validation
直接插入排序算法验证。
快速排序算法验证。
直接选择排序算法验证。
(Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)
- 2013-04-22 19:18:54下载
- 积分：1
