说明：  分析Unix最先适应（first fit，ff）存储分配算法。即map数据结构、存储分配函数ma lloc()和存储释放函数mfree()，找出与算法有关的成分。修改上述算法有关成分，使其分别体现BF(best fit，最佳适应)分配原则WF(worst fit，最坏适应)分配原则。
(Analysis of Unix was first to adapt to (first fit, ff) memory allocation algorithm. The map data structure, storage allocation function ma lloc () and memory release function mfree (), and algorithms to identify the elements. Modify the above algorithm as the ingredients, so that, respectively, embody BF (best fit, best fit) the principle of distribution WF (worst fit, the worst adaptation) distribution.)