C++ Builder程序员学习数据结构第6章

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).

深度优先搜索二叉树-depth-first search Binary Tree

c语言实现的八皇后问题的解法-c language of the Queen"s eight Solution

Unix下Oracle数据库开发必备资料-Unix under the essential information on Oracle database development

单源最短路径算法的C语言实现，刚学算法时写的，多多指教

用于模拟交通的排队-used to simulate traffic queue

数据库Blob读写-database Blob literacy

用VC++6.0开发多表联接的数据库应用程序-VC 6.0 multi-table database connectivity application

迭代计算一个四阶黎卡提方程-iterative calculation of a four bands Riccati equation

思想很简单，就是一个循环链表 但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表，然后我用从这个程序改过来的，所以代码可以进一步优化。-Thinking is very simple, that is, a cycle list but would like to note is: I use clist (1) to initialize, mainly because I had just started when Joseph did not intend to resolve the ring, just want to provision a table with the head circulation list, and then I used to come from this process, so the code can be further optimized.