It gets popped off the stack as one says and so you know what the values actually as we've hinted at with our brief discussions of forensics they're actually still there.

它从堆中释放了,那些值是什么，就像我们讨论的辩论练习,所暗示的,我们还在那里。

哈佛公开课 - 计算机科学课程节选

it's like finding a needle in a hay stack.

这简直是大海捞针。

It's like 课堂 - SpeakingMax英语口语达人

It turns out that slightly before the stack, slightly before this conceptual chunk of memory, there's other things called environment variables that we may see over time but elsewhere in memory are other things.

结果是稍微在堆之前，稍微在这个内存块概念之前，另外还一个东西叫做环境变量,我们之后可能看到，内存中的其他地方,是其他的东西。

哈佛公开课 - 计算机科学课程节选

Right. Those things are going to stack up, and eventually it's going to run out of space.

不用占用其他空间的算法，对，这些东西在运行的过程中会累积起来。

麻省理工公开课 - 计算机科学及编程导论课程节选

You just forget where the memory is that you asked for on the heap and it's not going to get cleaned up on the stack because malloc puts it somewhere else.

你忘了你在堆中申请的内存在哪里,它将会被栈清除,因为malloc把它放在别的地方。

哈佛公开课 - 计算机科学课程节选

So, certainly the CS50 Library designed to be dynamic and, in fact, any time you call get string, we are, in fact, ; allocating a chunk of RAM but it's not coming from the stack; it's actually coming from this portion of memory called the heap.

所以，Cs50库是动态设计的，实际上，每次你调用GetSting时，我们分配一块内存，但它不是来自栈;,而是来自于叫做堆的,内存的一部分。

哈佛公开课 - 计算机科学课程节选

Well, if you want to call a function, it's like putting another tray on that stack of trays and that tray represents a chunk of memory that, that function can use.

嗯，如果你想调用一个函数，这就像把一个托盘放到另一个托盘上,托盘代表一块，函数可以使用的内存。

哈佛公开课 - 计算机科学课程节选

If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?

如果我想移动这些圆盘，我先把从n-1个圆盘1,移动到多余的柱子上去，这样我就能把最底下的圆盘放到这儿了，然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对？

麻省理工公开课 - 计算机科学及编程导论课程节选

And, again, the rectangle represents your computer's RAM, the bottom represents the part of RAM that we generally call the stack, main conceptually ends up on the bottom of the stack followed foo by its local variables then the function say foo that it calls and on and on and on and up, but there is, in fact, something above all of this and we've seen this picture briefly and that's this thing called the heap.

再次，矩形表示的是计算机内存，底端表示内存的一部分,通常我们把它叫做堆栈，main函数在,堆栈的底端，之后是,它的局部变量，然后是它调用的函数,等等等等，但是那里有，实际上，在这个上面，我们粗略看看这个图画,这个东西叫做堆。

哈佛公开课 - 计算机科学课程节选