关于操作系统存储分配的最佳适应法，它从全部空闲区中找出能满足作业要求的、且大小最小的空闲分区，这种方法能使碎片尽量小。为适应此算法，空闲分区表（空闲区链）中的空闲分区要按大小从小到大进行排序，自表头开始查找到第一个满足要求的自由分区分配。该算法保留大的空闲区，但造成许多小的空闲区。-distribution of the operating system stored in the best adaptation, it all from the free zone to identify meet operational requirements. and the smallest size spare Division, this method can enable debris as small as possible. To meet this algorithm, and the leisure area (free zone chain), according to the idle zoning from small to large size sorting, Since the beginning of the first table to find a resolution to satisfy the requirements of the free distribution area. The algorithm to keep the majority of his leisure area, but many small leisure area.