二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。...

IOI 2001 解题报告 内容：所有题目的详细分析以及参考程序 此外还有Ｔｅｓｔ数据-IOI 2001 Solving the contents of the report: a detailed analysis of all the topics and make reference to procedures in addition to Test Data

最小生成树问题 若要在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.

回溯算法迷宫问题-VB代码是回溯算法非常经典的例子。可以做游戏做简单的参考

这是关于数据结构链表的源程序，用c++程序实现了每一个程序-this is a code of data structure

希尔和归并排序，基于数据结构的相关知识。-Hill and merge sort, based on the data structure knowledge.

基于数据库的编成，程序是模块化的编写，利用摁钮实现对话框的调用。数据库是SQL-based on the composition of the database, the procedure is the preparation of modular, using pressed the button to achieve box call. The database is SQL

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

// 带有列主元的高斯消元法 // 功能：　求解线性方程组 Ax = b // 参数：　A － 指向n*n系数矩阵的指针 // 　　　　b － 常数向量的指针 // 　　　　n － 方程组的维数 // 返回值：0 － 如果成功。线性方程组的解保存在 b 中 // 　　　　1 － 求解失败-//Carry out principal component of the Gaussian elimination method// function: solving linear equations Ax = b// parameters: A- point n* n coefficient matrix of the pointer// b- constant vector pointer// n- Equations dimension// return value: 0- if successful. Linear equations the solution stored in the b in// 1- Solving the failure of

一个精彩的奥运会成绩统计系统，可以统计金牌榜，总分榜，包含精彩的VFP界面，即时迅速统计各个国家的金牌及奖牌总数的变化-one of the highlights of the Olympic Games scores system, the gold medal tally and statistics, scores charts, Highlights include the VFP interface, immediate rapidly statistics in various countries gold and total medals changes

刚刚自己做的约瑟夫算法，是用链表实现的，很简单的，检验没错误，当然，中间有些东西可以根据需要自己改动-just doing Joseph algorithm is used to achieve the linked list, a very simple test not wrong, of course, Middle some things may need to change their own