本代码演示了使用MS SQL和delphi进行简单数据库开发，一个简单的学生成绩系统，附近中有数据库创建的文本...

算法导论introduction to algorithm答案-Introduction to algorithms introduction to algorithm answers

这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.

八皇后问题：用回溯算法做的 -8 Queens : The backtracking algorithm

数据结构算法实现及解析―配合严蔚敏_吴伟民编著的数据结构（C语言版和C++版）（作者 高一凡）源代码。 本代码含有严蔚敏《数据结构（C语言版）》和《数据结构（C++版）》两本书全书完整源代码，我在Visual C++、Dev C++、Turbo C、Turbo C++、DJGPP、MinGW上调试通过，正在学习数据结构的同学一定要看啊~对学习相当有帮助-Data Structure and Analysis of Algorithms- Wei-Min Yen with吴伟民_ edited by the data structure (C language and C++ version) (The author is one where high) source code. The code contains Yan Wei-Min " data structure (C language version)" and " data structure (C++ version)," book 2 books full source code at my Visual C++, Dev C++, Turbo C, Turbo C++, DJGPP, MinGW debugging through , is studying data structure must depend on the Student ah ~ there is a considerable help to the study

快速排序 基本思想：通过一趟排序，将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分记录的关键字小，则可分别对这两部分记录进行排序，以达到整个序列有序-Basic idea of quicksort: sort through the trip, will be to sort records is separated into two independent parts, some of which are recorded in another part of the record than keyword keyword small, then the two were part of the record sort, so as to achieve the entire sequence of orderly

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

ssd7考试2的答案，自己做的，98分的-2 answers ssd7 examination that he did, 98 points

实现已下功能： 1.创建有头结点的单链表存储多项式的指数和系数。 2.输出多项式。 3.多项式的相加。 4.多项式的相乘。

VC++语言实现与数据库连接的源代码，效果不错的-VC++ Language database connection with the source code, the effect of good

通过builder实现的数据结构各种算法 由于本人编程技术还没成熟，不足之处还请见谅-builder achieve through the data structure algorithms as I mature programming No shortage Department also requested forgiven