算法采用堆式数据结构查找可用内存分配。以下内容摘自http://www.cprogramming.com/tutorial/virtual_memory_and_heaps.html。

When new is invoked, it starts looking for a free memory block that fits the size for your request. Supposing that such a block of memory is found, it is marked as reserved and a pointer to that location is returned. There are several algorithms to accomplish this because a compromise has to be made between scanning the whole memory for finding the smallest free block bigger than the size of your object, or returning the first one where the memory needed fits. In order to improve the speed of getting a block of memory, the free and reserved areas of memory are maintained in a data structure similar to binary trees called a heap.

也许第一个实现的内存堆是由堆结构管理的?

它们有相同的名字，但实际上并不相似(甚至在概念上)。内存堆被称为堆，就像你把洗衣篮称为“一堆衣服”一样。这个名字用来表示一个有点混乱的地方，可以随意分配和释放内存。数据结构(正如你参考的维基百科链接所指出的)是完全不同的。

算法采用堆式数据结构查找可用内存分配。以下内容摘自http://www.cprogramming.com/tutorial/virtual_memory_and_heaps.html。

When new is invoked, it starts looking for a free memory block that fits the size for your request. Supposing that such a block of memory is found, it is marked as reserved and a pointer to that location is returned. There are several algorithms to accomplish this because a compromise has to be made between scanning the whole memory for finding the smallest free block bigger than the size of your object, or returning the first one where the memory needed fits. In order to improve the speed of getting a block of memory, the free and reserved areas of memory are maintained in a data structure similar to binary trees called a heap.

The name collision is unfortunate, but not all that mysterious. Heap is a small, common word used to mean a pile, collection, group, etc. The use of the word for the data structure pre-dates (I'm pretty sure) the name of the pool of memory. In fact, pool would have been a much better choice for the latter, in my opinion. Heap connotes a vertical structure (like a pile), which fits with the data structure, but not the memory pool. We don't think of a memory-pool heap as hierarchical, whereas the fundamental idea behind the data structure is keeping the largest element at the top of the heap (and sub-heaps).

堆的数据结构可以追溯到60年代中期;堆积记忆池，70年代初。术语堆(指内存池)至少早在1971年由Wijngaarden在Algol的讨论中使用。

可能最早使用堆作为数据结构是在 威廉姆斯，1964年。“算法232 -堆排序”，ACM通信7(6):347-348

实际上，读到内存分配的方式(参见Buddy Blocks)让我想起了数据结构中的堆。