This a collection of algorithms for sorting and searching.

简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题， 因为我用到gotoxy的,这个程序主要是练一个算法-simple demonstration, N size can be changed, but the rate of this procedure can also, than in the past I used to write a recursive that quicker. If N is too big change in exports, gotoxy because I used, the process is mainly a training algorithm

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

猴子摘香蕉问题使用C++语言描述，写的不好请大家多提意见！-Monkey mialaw problems using C++ language description, is badly written please speak up!

数据结构栈和队列相关练习，让你熟练掌握掌握它们的用法，迅速编程-Stack and queue data structure practice, so that you master

数据结构 八皇后问题解决方案一 很好的代码-8 Queen" s problem of data structure of a solution

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂-suoxiangshi jiajiancheng

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

sql数据库电子书-sql database e-books

一个自己写的com+数据模块的源码，对于写数据库的人很有用的-one wrote it myself com data module source code, the database was made for the very useful

施伯乐@黄皮书《数据结构教程》part2-Shi Bole @ beige book Data Structure Course part2