数据结构中，顺序表的各种基本运算，元素的增删改查等操作。其中，用C语言的一维数组实现线性表的顺序存储。
In the data structure, the basic operations of the sequence table, the addition, deletion, modification and query of elements are performed. One dimensional array of C language is used to realize the sequential storage of linear table. (2020-09-16, C/C++, 14KB, 下载0次)
根据最短路径，迪杰斯特拉算法、DFS算法对对已知图进行遍历，并绘制对应的最短路径，同时显示下一次遍历路径的选择
According to the shortest path, Dijkstra algorithm and DFS algorithm traverse the known graph, draw the corresponding shortest path, and display the selection of the next traverse path (2020-02-14, C/C++, 3KB, 下载1次)
利用最短路径算法生成车辆的最短路径，然后进行参数调整缩短车辆通过地图总时间
it is competition task in 2019 although our code is not complete but it may bring you some good ideas (2019-04-15, C/C++, 513KB, 下载1次)
Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。
Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path. (2016-05-16, C/C++, 1KB, 下载1次)
假设有一个数据类型为整型的一维数组A，A 中的数据元素呈无序状态，编写一个采用堆排序法将A中的数据元素按由小到大进行排序的程序。
Suppose there is a data type integer one-dimensional array A, A data element was disordered state, the preparation of a heap sort using the data elements of A are sorted by ascending process. (2013-08-03, C/C++, 5KB, 下载3次)
几乎包含了图的所有操作，邻接矩阵，邻接表建立，递归非递归深搜广艘遍历，floyd,prim,kruscal,地界斯特拉算法，拓扑排序，关键路径
Figure includes almost all the operations, the adjacency matrix, adjacency list creation, deep search recursive non-recursive traversal wide ship, floyd, prim, kruscal, boundary Stella algorithm, topological sorting, the critical path (2013-06-01, C/C++, 1415KB, 下载4次)
4. 试将感知机学习算法用C语言编成程序，并做下述的 维随机矢量 的二值分类的模拟实验：
（1） 用程序产生M个均值为0，方差为1的正态随机矢量（取维数 ，即 ， ；每个 为服从N(0,1) 分布的随机变量）。要求产生三组矢量（分别取M=10,20,30）, 分别用每组矢量训练一个感知机模型。对于每个训练矢量 ，给定其理想输出为 。在每组训练收敛后，再产生30个新矢量，用来检验所得到的感知机的分类性能。对每一组结果要给出收敛时所用的迭代次数 ，收敛时的权矢量值 ，和检验时所达到的正确分类率 。
perceptron (2012-12-04, C/C++, 1KB, 下载16次)
Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径
Dijkstra (Dijkstra) algorithm is a typical shortest path routing algorithm used to calculate a node to all other nodes of the shortest path (2011-11-18, C/C++, 1KB, 下载2次)
Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。
Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for computing a node to all other nodes of the shortest path. (2010-07-11, C/C++, 1KB, 下载5次)
里面包括了很多经典的算法，包括
河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）等等
Which includes many classic algorithms, including the Tower of Hanoi Fibonacci Liebasika triangular tri-color chess mouse labyrinth walk (1), etc. (2010-06-25, C/C++, 431KB, 下载3次)
使用一个一维数组和两个临时变量代替二维数组输出杨辉三角：方法同Fun_4，但更具有技巧，有点难懂
Using a one-dimensional array and two temporary variables instead of two-dimensional array of output Yang Hui triangle: the same Fun_4, but more skills, a little hard to understand (2010-05-26, C/C++, 1KB, 下载1次)
假设有一个数据类型为整型的一维数组A，A 中的数据元素呈无序状态，编写一个采用堆排序法将A中的数据元素按由小到大进行排序的程序。
Suppose a data type for the integer one-dimensional array A, A in the data element was disorder, to write a heap sort method used in the data elements A sort of process by small to large. (2010-05-11, C/C++, 1KB, 下载6次)
包含如何加是插入式排序、如何在快速法中處理值相等的元素，使得排序完成之後值相等的元素仍然維持原來的順序 等等....
Includes how to add plug-in is sorted, how to deal with in the fast-law elements of equal value, the value after the completion of the same sort of elements to maintain the original order and so on .... (2009-05-27, C/C++, 23KB, 下载1次)
利用数据结构栈的思想，按照四则运算加、减、乘、除、幂（^）和括号的优先关系和惯例，编写计算器程序
Stack data structure using the ideas, in accordance with the four operations add, subtract, multiply, divide, power (^) and the priority relations between the brackets and practice procedures for the preparation of calculator (2009-04-21, C/C++, 1KB, 下载7次)
本文章首先简要介绍了一维与二维情况下的最接近点对问题与所涉及到的解决算法.然后,把最接近点对问题延伸至三维,提出了自己的解决思想,并提供了相关伪代码,以供参考.请各位朋友多提建议!
err (2008-09-02, C/C++, 532KB, 下载25次)
常用算法程序集(C语言描述)第三版+徐士良
求约束条件下N维极值的复形调优法
Commonly used algorithm for assembly (C language description of) the third edition of+徐士良for binding under the conditions of the complex N-dimensional extremal optimization method (2008-05-22, C/C++, 1KB, 下载5次)
图结构有着广泛的应用，本实训主要涉及两个方面的内容：一个是有关图的最短路径问题，用一个交通查询系统例子来验证迪杰斯特拉算法和费洛伊德算法；而另一个则工程项目实施过程中的关键路径问题。
Graph structure has a wide application, the Training involves two main aspects: one is related to map the shortest path problem, using examples of a traffic inquiry system to verify Dijkstra algorithm and fees Lloyd algorithm and the other and one project implementation process of the critical path problem. (2008-05-15, C/C++, 6KB, 下载19次)
使用C语言实现高斯塞德尔迭代算法，GS迭代发是一种用于计算方程组的经典方法。
The use of C language to achieve high斯塞德尔iterative algorithm, GS-fat is a kind of iterative equations used to calculate the classical method. (2008-04-07, C/C++, 1KB, 下载6次)
经典八皇后问题——数据结构课程设计报告,虽然好多地方都有，我这个是按老师要求做好的，加个封面就可以直接上交。
Queen s classic eight questions- data structure of the curriculum design report, although a lot of places, I this is based on the teacher asked to do a good job, and add the cover can be directly handed over. (2008-01-21, C/C++, 103KB, 下载184次)
01背包问题题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包...但它却是另一个重要的背包问题P02最简捷的解决方案,故学习只用一维数组解01背包问题是十分必要的。
01 knapsack problem subject N items and a capacity of V backpack. The first i items cost c [i], the value of w [i]. Solution which items will be loaded backpack ... but it is another important knapsack problem P02 the most simple and quickest solution, it is to learn only one-dimensional array of 01 knapsack problem solution is very necessary. (2007-11-07, C/C++, 233KB, 下载29次)