拓扑排序c版(数据结构)1.邻接表的实现 2.无环情况

C++语言对字符串对象进行各种操作的子程序，对运算符的重载，实现对字符串方便的各种操作。-C language string object to the operation of various subroutine, right Operators of heavy realize the convenience of a string operation.

student select course system,powerbuilder做的，很容易实现 ,不会有人上载了吧-student select course system, powerbuilder done, it is easy to realize that no one on the right is contained

高级复制维护注意点- High-level duplication maintenance limelight

里面介绍的是严蔚敏《数据结构(c语言版)习题集》第二章答案-introduced inside the Yan Wei Min "data structure (c language version) Exercise Book," the second chapter answer

求解最短路径的程序。根据迪杰斯特拉的算法思想写出的程序。运行环境VC++6.0-Procedures for solving the shortest path. Dijkstra" s algorithm based on ideas to write procedures. VC++6.0 environment

first simple MCF exercise

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

VC++访问DAO数据库-VC visit DAO Database

射击运动员10发打中90环有多少种可能,递归算法-shooting 10 athletes hit the number 90 ring possible, recursive algorithm

常用算法的C语言描述。里边算法非常详尽。解压即可使用。-common algorithms described in C language. Inside algorithm very detailed. Decompression can be used.