Therefore, for simple branching programs, the length of time, the complexity the code, is what we would call constant.

因此，对于简单的分支程序，运行的时间长度，算法的复杂度，也就是我们说的常数。

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

But that's also nice, it lets you see how the recursive thing is simply unwrapping but the complexity in terms of the amount of time it takes is going to be the same.

它让我们看到了，在复杂度依照时间总数来看,没有变化的情况下,递归是怎么一步步的展开的,我欠你一个糖，谢谢。

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