为什么在c风格的语言中运行时堆被用于动态内存分配，而数据结构都被称为“堆”?有什么关系吗?
当前回答
算法采用堆式数据结构查找可用内存分配。以下内容摘自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.
其他回答
在我看来，这两个完全不相关的东西有相同的名字只是一个意外/巧合。就像图和图。
Donald Knuth说(《计算机编程艺术》，第三版，第1卷，第435页):
1975年左右，一些作者开始将可用内存池称为“堆”。
他没有说哪些作者，也没有给出任何特定论文的参考文献，但他确实说了，与优先级队列相关的术语“堆”的使用是这个词的传统意义。
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
在c++标准中并没有使用通俗的术语堆栈内存和堆内存。该标准使用静态存储、线程存储、自动存储和动态存储。
更多信息可以在标准的存储时间部分找到。
因此，从语言和标准库的角度来看，不存在混淆。
算法采用堆式数据结构查找可用内存分配。以下内容摘自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.
