-
the-dynamic-planning
本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts.
)
- 2011-12-15 16:49:05下载
- 积分：1
-
KMP
数据结构中KMP算法c语言实现，vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
- 2013-03-27 14:04:39下载
- 积分：1
-
quicksort
数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分：1
-
zhan
队列的顺序存储结构和操作实现
队列的顺序存储结构和操作实现(The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of)
- 2008-12-11 20:10:49下载
- 积分：1
-
FindMax
求矩阵的最大值
有一个整型二维数组，大小为m行n列，要求分别找出其中最大值所在的行和列，以及该矩阵中的最大值。
要求：
1.编写自定义函数MaxVal
函数的原型为：int MaxVal(int arr[][N], int *m, int *n)
功能：
数组中最大元素的值通过MaxVal函数的返回值传递给主函数，最大元素的行值和列值分别通过m和n传递给主程序相应的变量。
2.main主函数的功能
（1）变量定义
（2）输入数组各元素的值
（3）以二维矩阵形式输出数组中各元素的值
（4）调用MaxVal函数，或者insert函数
（5）输出数组中最大元素的值和该数组元素的行值和列值。
3.所有关于数组的操作尽量使用指针
(FindMax)
- 2010-10-12 23:15:24下载
- 积分：1
-
14160_1239592890aB1K
纯C语言写的小型通用数据库，一个C数据结构组科技小组的作品，附有开发思路PPT，这可是一个宝贵的资源哦，更底层的东西，运行于DOS提示符，可以新建数据库等操作。C的编程高手们值得参考一下。
(Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)
- 2009-04-13 12:50:21下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
-
maopao_youhua
冒泡优化：
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。
思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分：1
-
DoubleStack
数据结构基础内容，两栈共享空间，参考《大话数据结构》(Structural basis of data content, two stacks shared space, refer to Westward data structure )
- 2014-12-06 12:09:30下载
- 积分：1
-
strap_down_inertial_navigation
说明： 捷联系统C语言实现算法，已经过实验验证。(SINS C language algorithm, has been verified by tests.)
- 2008-11-20 16:50:37下载
- 积分：1
