数据结构课程实验之一，关于汉诺塔的问题，简单的小程序

该代码由 proteus 8 示意图与 PIC C 编译器的代码组成。串行数据时转移到虚拟终端，输入的端口设置为高。其基本的代码。

该系统允许注册新出租，改变现有的租金数据、 删除文件压缩的租金 按主索引键和辅助键搜索。

采用随机数来生成要排序的内容，并使用模板，可以很方便的更改产生随机数的类型。-Used to generate random numbers to sort the contents, and the use of templates, you can easily change the type of random numbers generated.

poj1411请多指教，多交流 0ms 交流算法-Please advice poj1411, more exchanges 0ms exchange algorithm

用于建筑的测斜数据处理!把测试设备的数据下载电脑,通过本系统进行分析,然后生成所需要的数据!-For construction of the inclinometer data processing! The test equipment data download computer, through an analysis of the system, and then generate the data needed!

直接插入排序 排序过程：整个排序过程为n-1趟插入，即先将序列中第1个记录看成是一个有序子序列，然后从第2个记录开始，逐个进行插入，直至整个序列有序-Direct Insertion Sort to sort the process: the whole process of sorting times for the n-1 insert, that is, first sequence of the first one recorded as an orderly sequence, and then from the first two records began to insert one by one until the entire sequence has Preface

全国计算机等级考试三级的部分上级题算法，对上机考试还不是很熟的人，很有帮助（并非书上的答案，是本人自己想的算法）-National Computer Rank Examination some three superiors that the algorithm, right on the test machine is not very familiar with the helpful (and not the answer book, I want to own the algorithm)

操作系统中的文件是通过文件目录项来管理的，为了管理和查找的方便，按层次把文件目录项组织起来，同一层上的目录构成该层上的目录，第一层为根目录，一下为各层子目录。 假设以一串字符代表一个文件，每个字符表示一个记录。 在建立上述目录结构的基础上，建立相应的管理系统并要求完成以下各项操作： 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

h3h3h3面并不很精通。我最近看的书《分行与小波》《小波十讲》《小波变换与分数傅里叶变换》《工程小波变换》等。上面所写，一部分来源于书，一部分来源于自己的体会。所以希望-h3h3h3 surface is not very proficient. I recently read "branch and wavelet" "wavelet 10 stresses" "wavelet transform and scores of Fourier transform," "project wavelet transform." The above was written part from the book, from the part of his experience. I hope

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20