用高级语言模拟实现动态分区存储管理，要求：

1、分区分配算法至少实现首次适应算法、最佳适应算法和最坏适应算法中的至少一种。熟悉并掌握各种算法的空闲区组织方式。

2、分区的初始化——可以由用户输入初始分区的大小。（初始化后只有一个空闲分区，起始地址为0，大小是用户输入的大小）

3、分区的动态分配过程：由用户输入作业号和作业的大小，实现分区过程。

4、分区的回收：用户输入作业号，实现分区回收，同时，分区的合并要体现出来。（注意：不存在的作业号要给出错误提示！）

分区的显示：任何时刻，可以查看当前内存的情况（起始地址是什么，大小多大的分区时空闲的，或者占用的，能够显示出来）-Through dynamic storage management with advanced simulation language requirements:

1, at least the first partition algorithm adaptation algorithm, the best and worst adaptation algorithm to adapt at least one algorithm. Familiar with and master the free zone organization of various algorithms.

2, initialize partitions- can enter the size of the initial partition by the user. (After initialization is only one free partition starting at address 0, the size is the size of user input)

3, dynamic allocation process partitions: input by a user job number and size of the job, to achieve the partitioning process.

4, partition recovery: the user enters the job number, to achieve recovery partition, while the partition you want to merge reflected. (Note: There is no job number to be given an error message!)

Partitions show: any time, you can view the current situation of memory (what the starting address, when the size of the partition much free or occupied, can be displayed)