Let's assume, for sake of argument, the thing I'm looking for is bigger than this. In that case, I'm going to throw away all of this, I'm going to hit that bottom line of that code.

让我们假定不是，假定要找的元素,比这个大，在这样的情况下，这些都擦掉，我要运行到代码的最后一行。

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

And also that we know that the zero does not count as a node, if per se I actually had managed to hit zero in drawing that, so the correct answer would be the bottom one there.

另外你们要知道零点不是节点，假设说我确实把零点画成０了，那正确的结果就是底下这个。

麻省理工公开课 - 化学原理课程节选

But the moment swap returns, the moment we hit this bottom most curly brace, what conceptually happens in memory?

但是swap返回时，当我们抵达花括号底端是，在内存中发生了什么？

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

So we hit the curly brace so the very bottom of the function and as soon as you hit that, the next line in the story is well, then we return to main and where are we executing in main?

我们抵达花括号了，这是函数的末尾了,一旦到了那个地方，在下一行，然后返回到main函数中，在main中哪里开始执行？

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