包含冒泡排序算法函数模板和数据结构中的字符串查找例子及解线性方程组的3个典型算法加演示。...

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

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

一个基于VC+ACCESS的通讯录系统设计，简单方便-a VC-based directories ACCESS system design is simple and convenient

将网页文件中的词汇提取出来，放入一个单独的mdb格式数据库-Page document vocabulary extracted into a separate database mdb format

资源描述C++写的购票系统，可以实现查询车次信息，购票，退票等功能，车次信息是提前预定好的，可以自己修改，考虑到了多个站点以及发车时间问题，解决了购票冲突问题，即在不同车站买到同一个座位上的车票。

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation

sql的语言手册下一部分-sql language under part Manual

在顺序存储结构上,采用顺序查找算法，直接插入排序算法等算法查找一关键字,输出查找结果-In the sequential storage structure, using the sequential search algorithm, sorting algorithm directly into the search for a keyword such as algorithms, the output search results

实现卡洛图的自动化简功能，最大字符为4个，即对于一个4 x4的数，将其中可以合并的1化简，得出最简和最优的结果，与手工化简结果一致-Calo plans to achieve automation SR function, the largest of the four characters, that is for a 4 x4 few, which will be an amalgamation of a simplification, reduction and produce the most optimal results, and manual results are consistent Simplification

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.