Thus, the general categorization of this algorithm is best-first with coalescing: Freed chunks are coalesced with neighboring ones, and held in bins that are searched in size order.

• 因此，这个算法一般被归类为带合并的最佳适合算法：释放的邻近的块被合并，并被保存在按大小搜索的箱子里。