索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。...

了解服务器的内部结构，对LOCK有一个 更高层次的认识。 建议有3年C++编程的朋友参考。-understanding of the internal structure of the server, right LOCK have a higher level of awareness. Proposal 3 years C programming reference to a friend.

本源码讲述如何把Excel文件转换成mdb数据库。-The source on how to convert Excel files mdb database.

五子棋(TC版),提供交互界面,TC2.0编译-331 (TC edition), provides interfaces to compile WITH TC 2.0

物业缴费管理系统-property Payment Management System

一个学生管理系统的常见功能是支持个人的维护和研究信息与有关的一名学生。下面的源代码和例子用于在 Java 中的学生管理系统。 在项目文件部分中列出的源代码和包含在此项目中的文件，请确保列出的源代码，该代码是否满足您的需要那里

This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wrote it because I found the other DBMSs code too bulky and hard to debug. It s designed for small applications and I doubt it could handle anything on a large scale. A sample program included in the .zip shows how everything works. The database project is a library project, so you ll have to compile and link with the .lib file to get everything working. Pros: - You have the source code so you know exactly what it is doing - Database files are very small - Small and fast code Cons: - Can t handle large amounts of records (more than 65000ish) - Doesn t support SQL (you have to search the database by cycling through the records and testing them against your constraints) - Each database file can only have one table. -This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wr

一个C++写的KdTree容器模板库，支持std容器，和自定义的存储方式，对插入、删除和查找作了优化-A C++ Written KdTree Template Library containers, support std containers, and custom storage by means of an insert, delete, and search was made to optimize

哈夫曼编码/译码 利用克鲁斯卡尔算法计算一段传输数据的哈夫曼编码，以提高信道利用率。-Huffman encoding/decoding algorithm using Kruskal data section of the Huffman coding, in order to improve channel utilization.

这是一个学生成绩的记录表练习，是数据结构中的链表实现的，对初学者有很大帮助，自己写的，多有不足，请大家一起完善。

递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm