SplitADT

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)

迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)

说明：  约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)

有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

单链表程序 可执行单链表的基本功能 创建 删除 查找 存取 等等(Basic functions to create a single linked list program executable single linked list delete find access)

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

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

此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists )

这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)

选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)