the intersection of inquiries

停车场管理系统2（数据结构实习报告）-car park management system 2 (data structure internship report)

C++经典大整数实现,加减乘除.输入输出-C classic large integer, the arithmetic. Input and Output

实现构造哈夫曼树的哈夫曼算法。 求解出所构造的哈夫曼 使用树的带权路径长度。 -Huffman tree structure to achieve the Huffman algorithm. Solving the structure of the Huffman tree with the right to use the path length.

数据结构（严蔚敏）的试验指导书籍，非常方便的一本书- i usuless for foreign school, it is a book about china s tutorial

这个程序包括了各种常用内部排序算法在平均排序所需时间上的比较.-this procedure include a wide range of internal sorting algorithm commonly used in the average time required for ordering on the comparison.

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 二 运行 1：创建数据库 将TRADE.sql中的SQL语句考入SQL Server的查询分析器中，全部运行； 2：建立ODBC数据源 数据原名称为Trade_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements TRADE.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Trade_MIS

实现卡洛图的自动化简功能，最大字符为4个，即对于一个4 x4的数，将其中可以合并的1化简，得出最简和最优的结果，与手工化简结果一致-Calo plans to achieve automation SR function, the largest of the four characters, that is for a 4 x4 few, which will be an amalgamation of a simplification, reduction and produce the most optimal results, and manual results are consistent Simplification

用VC++6.0开发多表联接的数据库应用程序 介绍了用Visual C++6.0开发数据库应用程序时，使用MFC ODBC类的编程方法，详细说明了在MFC ODBC的派生类中设置SQL语句参数的方法，实现了二个表的关联。 关键字 数据库 ，多表联接，MFC ODBC-VC 6.0 multi-table database connectivity application procedures introduced with Visual C 6.0 database application development, the use of MFC ODBC type of programming methods, a detailed description of the MFC category derived ODBC SQL set parameters and methodology of the two tables association. Keyword database, multi-table connectivity, ODBC MFC

用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program