jiaotong

对于数据结构每一章节的相应的练习题，巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)

中科大数据结构全部上机实验的实验程序以及报告，内容包括多项式，图，栈，SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)

北大ACM1702题 转换为3进制 很经典(NULL)

/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边， *基准值为一组，这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high，即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

C语言实现井字棋博弈的过程，采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)

主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)

数据结构中链式队列和堆栈的循环用法，非常有用(Queue data structure in the chain and the cycle stack usage, very useful)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)