mataqipan

矩阵运算器，c语言编程，数据结构，免费下载(Matrix calculator, c language programming, data structures, free download)

说明：  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

实现折半查找，非递归形式，从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)

关于C语言的一些指针的处理算法，能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)

最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)

最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)

POJ141的源代码，以空间换时间，速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)

数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)