Paksoft 图书馆管理系统

数据结构的一些简单编程题,二叉树结构，遍历的递归于非递归算法-data structure that some simple programming, binary tree structure, traverse the non- recursive recursive algorithm

是数据结构中经常见到的矩阵运算，包括＋,-,* 。-data structure is often seen matrix operations, including+,-,*.

vc编写的小型旅馆管理系统-vc prepared by the small hotel management system

迷宫问题 数据结构-maze data structure problem

该程序实现了用文件记录变长字节流，可用以存储各种类型的文件，如多媒体数据，声音、图形、图像等。每项记录由记录号和标志符标记。记录的记录号和标识均可用作对记录的定位和引用，记录号可以由操作者输入，也可以自动生成，标志符一定要由操作者输入。

这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.

2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.

二叉树的各种操作，包括二叉树的建立，前序、中序、后序遍历二叉树，另外还包含一个霍夫曼编码的实现。-Binary tree of various operations, including the establishment of binary tree, the former sequence, in order, after the tree traversal, and also includes the implementation of a Huffman code.

设有n个人站成一圈，每个人持有一个密码（正整数)。现从第t个人开始，按顺时针方向“1,2,3,4,…”循环报数，数到m1（第t个人所持密码）的人出列，然后从出列者的下一个人重新开始报数，数到m2（刚出列者所持密码）的人又出列，如此重复进行，直到n个人都出列为止。-something like Joseph problem

用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等,还可以选择排序数据的个数,初态,控制等.-using data prepared by the internal order, the window can choose a variety of sequencing methods, such as fast Pai, bubbling half insert, can also choose the number of original data, the initial state, and control.