vb编的医院管理系统，需要的可以下载，有兴趣自行习惯

篮球赛抽签系统，先输入球队数，由随机函数在1-N抽取一个数，作为初始密码，出列第一支球队，然后根据各队输入本队密码，利用joseph环，使每次出列的球队密码作为新的密码，直到所有球队出列，即可确定分组顺序-Basketball lottery system, first enter the team number by the random function in the 1-N taken a number, as the initial password, the first teams out of the column, and then each team enter the team password, using joseph ring, so that each second team out of the column as a new password password, until all the teams out of the column, you can determine the packet sequence

一个用vb开发的档案管理程序-a development with vb file management procedures

SQLite中如何用API操作BLOB类型的字段-how to use SQLite API type BLOB fields

网上有很多的压缩程序，本程序实现了最简单的一种算法－lzw压缩算法，其中用到了hashtable-many online compression procedures, the procedures for the realization of a simple algorithm-lzw compression algorithm, which stretched to the hashtable

数据库连接池的代码-database connection pool code

KMP算法是一个查找两个字符串公共串的算法,比一般的算法效率要高很多.-KMP algorithm is a two string public string search algorithms, than the average efficiency of the algorithm is much higher.

在网络上收集的100个经典例子-online collection of 100 classic example

这是一个练习链表的扑克牌程序，可以自动发牌，比较大小。如果想和计算机对战，只需要稍微改动一下程序即可。-This is a practice Chain cards procedures, it will automatically licensing, size comparison. If you want to, and computer war, only slightly modifying procedures.

数据结构课程第一次实验 要求：1.基类和派生类的定义和实现（.h .cpp） 2.+ 运算符重载 3.

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;