3）必须模拟该4种内存分配算法：first fit，next fit，best fit和worst fit中的至少2种。

4） 需显示出每次分配和回收后的空闲分区链的情况来以及内存占用情况图，并统计各种算法产生的碎片空闲区（小于3个单元（unit）的空闲区）数。

5）计算2个性能参数：碎片数、平均搜索空闲区次数-3) must simulate the four kinds of memory allocation algorithms: first fit, at least two kinds of next fit, best fit and worst fit in. 4) the need to show the situation after each allocation and recovery partition chain to idle and memory usage graph and statistical debris generated by various algorithms free zone (less than 3 units (unit) free zone) number. 5) Calculation of individual performance parameters: the number of fragments, the average number of idle search area