最佳适应法

代码说明：

  采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。(used first to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. Dynamic random to create a new "memory allocation" or "memory recovery" request, then you have chosen in accordance with the allocation algorithm to change the array. As the focus of this experiment is memory allocation, it is not considered relevant to a certain memory area of the process.)

文件列表：