堆排序(HeapSort)是一树形选择排序。堆排序的特点是：在排序过程中，将R[l..n]看成是一棵完全二叉树的顺序存储结构，利用完全二叉树中双亲结点和孩子结点之间的内在关系(参见二叉树的顺序存储结构)，在当前无序区中选择关键字最大(或最小)的记录-Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete b

一种RFID识别算法的模拟，模拟了采用多叉树存储的数据如何快速查找的过程，可以在VC++下运行。-An RFID identification algorithm simulation, simulation of a multi-tree storage of data is how to quickly find the process can run VC++ under.

一个采用可变式分区分配的存储管理方案，可以模拟实现分区的分配和回收过程。分区管理法采用的是首次适应算法-Variable partition is assigned a use storage management solutions, it can be simulated distribution and recovery process partition. Partition management method uses a first-fit algorithm