说明：  　　　存储管理——动态分区分配算法的模拟： 　　要求设计主界面以灵活选择某算法，以下算法都要实现： 　　首次适应算法 　　循环首次适应算法 　　最佳适应算法； 　　最坏适应算法； 　　快速适应算法 具体要求： 首先由系统生成当前的内存状态，按照课本P122图4-5（a）所示，要求未分配的分区数量不少于3个，且空间大小随机，然后随机生成一个数，表示等待分配进程的大小。 然后显示上述算法由用户选择，结果显示分配后的状态。
(Storage management- dynamic partition allocation algorithm simulation: the flexibility to choose an algorithm, the following algorithm should achieve the best fit algorithm first-fit algorithm: first-fit algorithm loop worst adaptation algorithm designed main interface quickly adapt to a specific algorithm requirements: First, the current generated by the system memory status, in accordance with the textbooks P122 Figure 4-5 (a) shown required number of unallocated partitions of not less than three and a space the size of random, and then randomly generates a number, waiting to be assigned The size of the process. Selected by the user and then displays the above algorithm, the results show the state after the allocation.)