本书主要介绍Delphi的数据库编程知识，为Delphi开发人员提供了很好的指导。...

java常用的排序算法源码，从最基本的冒泡排序到快速排序，基排序等各种实现 -commonly used sorting algorithm java source code, from the most basic to the Quick Sort Bubble Sort, sort, etc. to achieve the base

用C语言编写。数据结构，任意输入数值的折半查找。-Using C language. Data structures, arbitrary input values to find the half.

物流管理信息系统， 内含Delphi源码， 有Access数据库， 还有文档说明及数据库说明。

这些是数据结构结构的经典实现算法，是学习数据结构必须掌握的-shu ju jie gou jing dian suan fa shi xian

数据结构中图的相关操作,数据结构中图的相关操作-data structure of the plan related operations, data structure of the plan related to operation

二叉树dsff soih o ijd sh-erchashuddddddddddddddddddddddddddddddd

java 数据库 功能强大 效率高 SmallSQL Database is a free DBMS library for the Java(tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API. SmallSQL Database is licensed under the terms of the GNU Lesser General Public Licence (LGPL). A copy of the licence is included in the distribution. Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Please refer to the licence for details.-java a powerful and efficient database SmallSQL Database is a free DBMS library for the Java (tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API.SmallSQL Database is licensed under the terms of the GNU Lesser GeneralPublic Licence (LGPL). A copy of the licence is included in thedistribution.Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTAB

代码名称：资料管理系统 一个资料管理系统的源程序，VB+ACCESS2000+ADO，功能强大-code name : an information management system information management system of the source, VB ACCESS2000 ADO, powerful

一个非常不错的商业进销存软件，用PB写的。-a very good business Invoicing software, used to write the PB.

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri