一道北大acm的试题，用双向链表实现模拟内存分配的程序

很好的VFP6.0源代码程序.人事管理系统-good VFP6.0 source code procedures. Personnel Management System

数据库pb语言的一些程序示例,给pb学习者参考使用,希望能给大家带来帮助!-database pb language sample some of the procedures for the use and reference pb learners, we can bring help!

不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."

数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法-algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.

小波变换算法，运用小波理论，优化其核心算法，提高计算效率-wavelet transform algorithm, using wavelet theory, optimizing their core algorithm, improve computational efficiency

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword

汉诺塔代码,从第一个木桩中,把所有盘子从大到小搬移到第三个木桩中.-HANOR code from a wooden blocks, all the dishes to the smallest movement pickets were third.

酷Grid控件示例 ... ..cj.CDX ..............cj.dbf ..............MyGrid.SCT ..............MyGrid.scx ..............MZ.DBF .............. eadme.dbf .............. eadme.FPT .............. eadme.txt ..............xsda.CDX ..............xsda.dbf -Cool Grid Control example .............. cj.CDX ...... ........ cj.dbf .............. MyGrid.SCT .............. MyGrid.scx .............. MZ.DBF .............. readme.dbf ......... ..... readme.FPT .............. readme.tx t .............. xsda.CDX .............. x sda.dbf

健身俱乐部管理系统，包括会员图片的保存和显示，读卡机的使用-fitness club management system, including members of the preservation and photographs showed that the use of Reader