最佳适应算法 信安 陆华锋 20022638

代码说明：

  最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。(best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.)