二路归并算法的代码,用来排序，文件后缀名是c

ADO MD 程序员参考手册 书籍语言： 简体中文 书籍类型： 程序设计 授权方式： 免费软件 书籍大小： 808 KB -ADO MD programmer"s reference manual books Language : English books categories : program design license : free software books Size : 808 KB

用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing

学生初学，c实现约瑟夫环(圆桌问题)，算法应该不是很高效，望各位高人看了改进改进！-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!

这是我的数据结构课程设计源代码，请务必按提示输入数据，该程序的功能是用链表实现多项式的四则运算。-This is my data structure course design source code, you must follow the directions to input data, the program"s function is used to achieve Chain of four polynomial operations.

VC 连接 SQL的例子-an example of connecting sql by vc

本文详细论述了网上考试系统的设计与实现，该系统基本实现了需求分析中的功能要求，其中考生信息主要由数据库直接输入，考生成功登录后进入考生界面，考生界面主要由考试、成绩查询，试时考生输入准考证号码、考生姓名、验证码，核对正确后进入考场，关键实现了考生在选择科目后由系统随机抽题、自动组卷后进入考试页面，考-This article discusses in detail the design of online examination system and implementation of the system to achieve a basic needs analysis of the functional requirements, in which candidates from the database information directly into the main candidates to enter the candidates after the successful login interface, the main candidates from the interface results in the examination information, test when the candidates enter the ticket number, candidate name, authentication code to enter the examination room after checking the correct key to the achievement of the candidates in the selection of subjects were randomly drawn by the system after the title, Automatic Test Paper into test page test

自编的波兰、逆波兰、中缀表达式计算的小程序，在VS2005下通过编译运行。-Self of Poland, against Poland, in the calculation expression is made up of small procedures, in VS2005 to run through the compiler.

在计算机科学中，链表是；

这是一个关于acccess的数据库的一点技巧，希望对大家有帮助-This is a database on the acccess point techniques, we hope to help

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