是数据结构中的基数排序算法，挺不错的，谢谢大家

处理机调度的算法，操作系统的课程设计，主要是应用轮转法进行进程的调度-processor scheduling algorithms, operating system design of Web applications is the main method of the scheduling process

pb做出的outlook界面框架,可以直接用在管理信息系统中来使用.-pb"s outlook interface framework, can be directly used in the management information systems to use it.

sqlite轻量级数据库,适用于嵌入式系统的开发-sqlite database, applicable to embedded system development

Delphi编程┃Delphi数据库编程-Delphi programming highlights Delphi Database Programming

数据结构的经典示例

一个小数据库系统,具体内容为班级通讯录,比较全-A small database system, the specific contents of address book for the class to compare the whole

具有电影院的界面和功能，是基础，提供给初学数据库的人-Interface with a cinema and functions are the basis of the database available to the person learning

计算机数据结构课程设计，图书管理系统c语言版（含有软件设计书）.-Computer data structures curriculum design, library management system c language version (with software design book).

清华大学数据结构课上实现的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;

马跳棋盘递归算法(TC实现,并提供示意图),可移植到任何C编译器-Ma checkerboard recursive algorithm (TC achieved, and to provide diagram), and can be transplanted to any C compiler