2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的...

MatrixStatic一个不错的管理系统源码-MatrixStatic a good source management system

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence

数据结构课程设计_任意大数的加减乘运算器-_ Data structure design curriculum arbitrary multiplication addition and subtraction of large numbers of devices

c常用算法，用语言编写，为本人数据结构与算法设计作品，在VC++环境下编译通过-c commonly used algorithm, the language used to prepare for my data structure and algorithm design works in the VC environment compile

一个关于数据结构哈夫曼编/译码的程序-Another Huffman tree coding Algorithm for Data Structure.

基于二叉树的图最有路径算法，在图能转化到二叉树表示时，可求解-the best path based on binary tree

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

线性代数中的矩阵求逆的问题，使用此算法可以简化矩阵的操作。-linear algebra of matrix inversion, the use of this algorithm can be simplified matrix operation.

是我应我们学校学工部做的软件,其主要是解决想我们学校这样的条件--各个办公室之间还没有建立联网,而且学校分为两个校区（又不在一个城市). 　　因此，学工部每年的学分登记工作都很麻烦．每学年初，学工部要把当年发布的学分评测规定发到各系，学年末又要把从系里面提交的学分表收齐,然后手工登记,非常的麻烦.有时是系里面的学分报表太乱，有些资料丢失，要么是，系里面把各年的学分评测规定弄混，经常搞的他们一头雾水，于是为他们就请我做这个系统. 　　这个系统的工作流程是，每个学年初，学工部输入当年的学分评定规定，然后到处成为学分评测数据，然后Copy给各个系，各个系在每个学年中，输入新的专业，年级，班级和新生的资料，然后登记学分评测的纪录和考试的成绩．当学年末到了，各系把党学年的数据导成数据库，然后copy给学工部，学工部就可以用电脑纪录所有的学分纪录． -should I do our school among a software, it is our resolve to schools such conditions-- every office has not yet been established between the network and the school is divided into two campuses (not in a city). Therefore, each of the credit among a registration work very troublesome. Every beginning of the school year, among a year should release the credit evaluation of the provisions of the various faculties, should also learn from the end line inside the table collected credits, and then manual registration, very troublesome. Sometimes there is too much of the credit chaos statements, some of the inform

外部排序程序，foxpro的DBF文件中某个字段的程序，特点是可以指定排序内存大小，但可以排序超级大的文件远远超出机器内存，采用快速排序加失败树合并算法，排序中会产生很多临时小文件。修改后可用于任何文件字段排序。-External sort procedure, foxpro of DBF files in a field procedure, and there is a sort of memory you can specify the size, but you can sort super large files far beyond the machine memory, the use of quick sort algorithm plus the failure of the merger tree, sorting will produce many temporary small files. The revised document can be used for any sort by that field.