C language data structures Several structures, including Critical Path procedure...

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

可以进行简单的S型座位编排！这是一个数据库应用的小程序，可以继续扩展其功能-can conduct a simple S-type seating arrangements! This is a small database application procedures, can continue to expand its functions

学习数据结构写的排序代码，有冒泡排序、直接插入、希尔排序、简单选择排序、快速排序、堆排序-study data structure was sort of code, Bubble Sort directly inserted, Hill, in order of simple choice, in order of Quick Sort, Heap Sort

数据库辅助工具帮助数据库管理以及程序开发者提高效率的小工具源码。SQL Tools工具有可能不被系统支持 的解决办法 如果系统没有安装数据库或者缺少相关组件，可能会导致程序不能正常工作！在源码中没有附带解决方法，这个是我的疏忽。一下补上内容：SqlTool补丁使用方法：第一步：首先将msvcr71.dll, ?SQLDMO.DLL,拷贝到C:Program FilesMicrosoft SQL Server80ToolsBinn目录。?第二步：打开开始，在运行中输入 regsvr32 "C:Program FilesMicrosoft SQL Server80ToolsBinnsqldmo.dll" 注册sqldmo.dll。问题解决组件下载链接：http://pan.baidu.com/s/1zN21v 

用链表实现多项式的加法与乘法，链表是采用数据结构里面的单链表-polynomial with the addition and multiplication, linked list data structure is used inside the single-linked list

一个通讯录程序，Access 数据库，ODBC-a directory procedures, Access databases, ODBC

Its about data structure Tr-Its about data structure Tree

穷举密码算法 /在许多情况下我们需要穷举组合的算法，比如密码词典。 //这个算法的关键是密码下标进位的问题。 //另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。 //如果要提高写文件的效率，可以使用缓冲区，分批写入。-Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms, such as the password dictionary.// This algorithm, the key is password subscript binary problems.// Another example of this statement to write a document relatively low efficiency, in order to reduce the algorithm complexity is not optimized.// If you want to improve the efficiency of writing documents, you can use the buffer, write in batches.

this a program for for database implement in this we are implementing several join algorithms

约瑟夫环 已知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