sort-algorithm-validation

道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)

输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)

八皇后算法，用的是最简单的穷举法，在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)

数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)

使用全排列实现hash，看看吧相信对大家会有些帮助的(Full array hash)

哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

数据结构的课程设计，做的是一个交通查询，主要用到图的算法，和大家共享，欢迎指正！(Data structure curriculum design, do a query traffic, mainly used graph algorithms, and share, please correct me!)