这是一个好用的MD5的C++类；这个类可以加在控制台 程序中也可用在MFC中， 并且提供了详细的错误处理 函数，是一个安全的类。例程是一个MD5的MFC程序，...

数据结构学习中遇到的二叉树的代码，运行快速-Study data structure encountered in the code tree, run fast

一个电力企业的后台管理程序，请大家笑纳-The background of a power enterprise management process, please笑纳

数据结构编程 实现数的插入-data structure programming several of the insert, etc.

这是一个运用多种排序法对数据进行排序的程序,排序时间复杂性小,空间复杂性小,排序速度快.压缩包包括源程序文件,再vc中运行.-This is a use of a variety of data sequencing procedures for ordering, scheduling time complexity of small, space complexity of small, fast order. Compressed including source files, then vc run.

利用C语言编的二十四点小游戏，在C语言下可直接运行。-use of the C language Part 24 small game, in the C language can be run directly.

数据结构课程设计 B-树 等 希望对大家有帮助-Data Structure Course Design B-trees, etc. We want to help

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

文件管理系统1.0Bjsp-document management system 1.0Bjsp

Visual C++ +SQL Server数据库开发与实例一书所附源代码-Visual C+++ SQL Server database development and an accompanying source code examples of

该工程是动态数组的实现，其中已经1. 实现了异常处理模块（C语言实现，非C++）；2. 实现了内存管理模块，可以很轻松的申请内存，释放内存;3. 实现了动态数组的创建、释放等操作欢迎下载，欢迎回复