数据结构中排序的实例分析，可供有兴趣的朋友参考学习

数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm

进制转换是数据结构中的栈的应用的一个典型例子- Enters the system transformation is in a construction of data stack application typical example

用于车辆保险维修。在公路边，许多车辆都要保存一个记录，以便为特定的自行车盗窃和事故投保

&这个项目是用C语言编写的。它描述了apriori算法、关联规则、数据挖掘的简单实现；

一款很使用的数据库代码-one is the use of the database code

求最近点对问题， 求最近点对问题。-Nearest point on the issue of demand, and the nearest point on the issue, and the nearest point on the issue.

this is a tunning algorithem

篮球赛抽签系统，先输入球队数，由随机函数在1-N抽取一个数，作为初始密码，出列第一支球队，然后根据各队输入本队密码，利用joseph环，使每次出列的球队密码作为新的密码，直到所有球队出列，即可确定分组顺序-Basketball lottery system, first enter the team number by the random function in the 1-N taken a number, as the initial password, the first teams out of the column, and then each team enter the team password, using joseph ring, so that each second team out of the column as a new password password, until all the teams out of the column, you can determine the packet sequence

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.

数据结构与算法-程序、素材Kruskal构造算法-Data Structures and Algorithms- procedures, materials Kruskal Algorithm