数据结构学习课程中的查找问题，代码简单易懂

一个短小精悍的PARADOX数据文件DB的修复工具，能修复绝大多数损坏的DB文件。-a small and PARADOX DB data file repair tool to repair damage to the majority of DB documents.

这是一个经典的寻找最近点对的算法实现，运用VC编写，采用类的方式，是程序更易理解。-This is a classic look for the nearest point of the algorithm, using VC preparation, the type used, the way the process easier to understand.

一套采用php+mysql数据库方式运行的多用户网上商城系统，具有安全、负载量高，访问迅捷的特点，能与论坛、博客、CMS等系统整合并支持一站登陆。系统内置贝宝、支付宝、快钱等在线支付网关以及QQ、旺旺、雅虎通即时网络通讯工具.-Adopted a set of php+ Mysql database running multi-user online mall system with safe, high-load, quick visit to the features with forums, blog, CMS, such as systems integration and support the one-stop landing. PayPal embedded system, AliPay, quick money, such as online payment gateways, as well as QQ, Wangwang, Instant Messenger network communication tools.

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

UseBB一个用PHP和Mysql数据库开发的开源论坛，与其他流行的论坛不同，UseBB不是一味的追求拥有多少功能，而是以开发简单易用的论坛为目标。UseBB对于那些需要在资源有限的虚拟主机上架设一个易于使用的论坛是一个很好的选择。-UseBB a database using PHP and Mysql development of open-source forums, and other popular forums, UseBB pursuit rather than how much function, but in order to develop easy-to-use platform for the target. UseBB for those in need with limited resources to set up virtual hosts on a easy-to-use forum is a good choice.

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of

红黑树性质 红黑树是每个结点都带有颜色属性的二叉查找树，颜色为红色或黑色。在二叉查找树强制一般要求以外，对于任何有效的红黑树我们增加了如下的额外要求： 列表项结点是红色或黑色。 根是黑色。 所有叶子都是黑色（叶子是NIL结点）。 每个红色结点必须有两个黑色的子结点。（从每个叶子到根的所有路径上不能有两个连续的红色结点。） 从任一结点到其每个叶子的所有简单路径都包含相同数目的黑色结点。 为了便于处理红黑树中的边界情况，使用一个哨兵来代表所有的NIL结点，也就是说所有指向NIL的指针都指向哨兵T.nil。

VB图书管理系统，基于VB的图书管理系统的程序开发，只作参考-VB library management system, library management system based on the VB-program development, only for reference

自己帮家里人写的一个废品收购管理数据库系统，数据库用的access，界面用的VC-To help people write their own home to buy a waste management database system, the database used access, interface with the VC

利用c++写的双向链表操作，有头插入，尾插入，中间寻找“朋友“的方式插入，适合简单数据结构分析