首次适应算法（First Fit）：

从空闲分区表的第一个表目起查找该表，把最先能够满足要求的空闲区分配给作业，这种方法目的在于减少查找时间。为适应这种算法，空闲分区表（空闲区链）中的空闲分区要按地址由低到高进行排序。该算法优先使用低址部分空闲区，在低址空间造成许多小的空闲区，在高地址空间保留大的空闲区。

-Algorithm to adapt the first time (First Fit): free the partition table from the first table heading search from the table, the first to meet the requirements of the free zone allocated to the operation, this approach aims to reduce the search time. Order to adapt to this algorithm, the partition table is idle (idle area chain) in the free district in accordance with the address from low to high sort. The algorithm given priority in the use of low idle part of the site area, site of space caused by the low number of small free zone, in the high address space to retain a large free area.