计算圆周率 Pi (π)值, 精确到小数点后 10000 位 只需要 30 多句代码！...

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

考研数据结构辅导材料，包含6章（.ppt文档）-taking tests guidance material contained in Chapter 6 (. Ppt files)

Fibonacci数列的c语言实现-Fibonacci Sequence C Language

魔方阵完整算法（内含详细解释） 包括奇数和偶数 在VC6.0下运行-Magic matrix integrity algorithm (containing detailed explanation), including odd and even run in VC6.0

操作系统中的文件是通过文件目录项来管理的，为了管理和查找的方便，按层次把文件目录项组织起来，同一层上的目录构成该层上的目录，第一层为根目录，一下为各层子目录。 假设以一串字符代表一个文件，每个字符表示一个记录。 在建立上述目录结构的基础上，建立相应的管理系统并要求完成以下各项操作： 1． 一次建立各个文件 2． 查访两个用户的所有文件 3． 查访用户sun 是否有文件AB 4． 删除用户sun的文件AC,然后在分别查访两个用户的全部文件，检查是否已经删除文件AC 5． 撤销用户sun,并检查是否被删除 6． 删除用户sun的全部文件，然后在撤销sun用户，在查访用户sun, 检查其是否已被撤销。 在建立一个新用户及新用户的两个文件，然后查该两个用户的所有文件-operating system, the paper is to document catalog items to the management, in order to manage and facilitate the search, according to the document level directory entries organizations, the same floor on which constitute the directory contents on the floor, the first layer of the root directory to look for levels of subdirectories. Assuming that the representative of a string of characters, each character expressed a record. In establishing the directory structure on the basis of the establishment of a corresponding system of management and asked to accomplish the following : 1. Once established two separate files. Visits to the two users of all three docum

数据结构双链表的 例子-data structure-Chain example

最小生成树,基本满足最小生成树的所有的要求。-Minimum spanning tree, minimum spanning tree basically meet all the requirements.

归并外排序,要先运行file程序，在硬盘上建立dat文件，再运行排序程序-ranking first run file procedures, the establishment of dat drives on paper, sorting operation procedures

一个程序而已，不过看看也有好处-a procedure adopted, but it is also good to see

C语言常用算法源代码,数据结构原理实现， 对学习应用有参考价值。-C language source code commonly used algorithms and data structures to achieve the principle of learning about the application of a reference value.