一个快速排序算法的实现例子，数据结构课程作业，可作研究学习之用。 包含源文件和详细的开发文档，可方便移植到C等语言平台。...

数据结构课程的实验之一，有关于数组的循环位移，简单的小程序-Experimental data structure course one of the cycle of displacement on the array, a simple applet

数据库编程资料 CHM版本 在VCBASE上找到的 很有用处 很方便-CHM version of the database programming information found on the useful VCBASE easy

这是一个学生成绩的记录表练习，是数据结构中的链表实现的，对初学者有很大帮助，自己写的，多有不足，请大家一起完善。

ado-xmlcaozuo

适合用来做K_Means 和K_NN的数据，一共150组，分成3个簇。-K_Means and make suitable for K_NN data, a total of 150 groups, divided into three clusters.

给定一个（无向）图G，及G中的两点s、t，确定一条从s到t的最短路径。-Given a (undirected) graph G, and G in two points s, t, determined from s to t of a shortest path.

数据结构课程设计 AVL树等 希望对大家有帮助-AVL tree data structure, such as curriculum design, we want to help

minilist类的实现。数据结构的作业之一，用c++实现minilist类，已经通过测试。-minilist class implementation. One of the data structures, using c++ implementation minilist classes have been tested.

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决―――直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推―――直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull hi

源代码，是java实现的，比较清晰和第一部分一起的-Source code, is a java implementation to compare with the clarity and the first part of the