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

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

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

And then I'm going to just return the bigger of the two. Little bit complicated, but it's basically just implementing this decision tree.

我会计算总价值,然后我会返回两者中的较大值，有点小复杂,但是它就是按照这个决策树在运行。

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

I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.

我需要得到此算法的时间复杂度,那就明确地给出其,运行时间。

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

Remember last time, I said that there's different kinds of complexity in our code, and I suggested for simple branching programs, the amount of time it takes to run that program is, in essence, bounded by the number of instructions, because you only execute each instruction at most once.

但是这里有个很重要的点,记得上节课，我提过在我们的代码中，有不同种类的复杂度，而且我还说了对于简单的分支程序,运行这种程序需要的总体时间,大体上，是和指令的数目相关的,因为每个指令只会被执行最多一次。

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