KD-tree

约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)

.h文件。c++中的复数类，能够直接完成基本四则运算，输入输出流，完成一定范围内的比较运算(. H file. c++ classes in the plural, to directly perform basic arithmetic, input and output streams, to complete a range of comparison operators)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(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.)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

蜂群算法C语言实现，附带中文注释，简单易懂(ABC algorithm coded using C programming language)

1.建立两个有序得链表（带表头，用头插法）； //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)

这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)