And I'm going to show you an example in a 1 second, just to drive this home, but notice the characteristics. In the first two cases, the problem reduced by 1 at each step.

在前面两个例子里,每一部问题的规模缩小了,不管是迭代的还是递归的，这表明这个问题的复杂性可能是线性的。

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

Nano hello c We did Nano for hello.c or whatever I called it, GCC to actually compile into 0s and 1, and then step three is to actually run it.

首先，第二，GCC，hello，c把它编译成01二进制文件，第三，运行。

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