算法设计与分析实验报告，内容很全面的，呵呵。

our homework big project

根据事务文件成批地更改主文件并得到一个新的主文件，与吴伟民数据结构课本完全一致，用C实现-Affairs bulk to change the primary document to be a new master file, and data structure Xiulan WU Weimin textbooks entirely consistent with achieving C

这是一个运用多种排序法对数据进行排序的程序,排序时间复杂性小,空间复杂性小,排序速度快.压缩包包括源程序文件,再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.

求无向图连通分支_dfs实现,很好用，希望和大家分享-For undirected graph connectivity _dfs branch to achieve

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

堆栈操作，用来实现大树精确加法，可以任意数的位数-stack

遍里数据库集合里的数据-times database, the data pool

A.STEVENS 用C语言开发的数据库 -A.STEVENS database by c

实现拓扑排序，用到了堆栈，存储结构采用邻接表。-To achieve topological sorting, use the stack, storage structure using adjacency list.

经MMX, SSE 2优化后的MEMCPY,比VC中的MEMCPY快不少-as MMX, SSE, SSE2 optimization of MEMCPY than the VC lot faster MEMCPY