-
Therefore, for simple branching programs, the length of time, the complexity the code, is what we would call constant.
因此，对于简单的分支程序，运行的时间长度，算法的复杂度，也就是我们说的常数。
-
Over all possible inputs to this function, what's the fastest it runs? The fewest, so the minimum, if you like.
哪个输入程序运行的最快？,用的时间最少？如果你喜欢的话，这个方法看起来不错。
-
Said a different way, in the case of the straight-line programs, how long would it take to run a program?
换种说法，在直线式程序里面，运行一个程序要多长时间？
-
All right? If you run it, you have a sense of the upper bound, about how much time it's going to take to do this computation, so you're not going to get surprised by something showing up.
第一，这样做意味着没有意外了对不对？,你去运行程序,你已经大致知道运行时间的上限了，因此发生任何事情,你都不会吃惊了。
-
What I want to think about though, is, how much time does this take?
我想的是，这个程序需要多长的时间来运行？
-
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.
但是这里有个很重要的点,记得上节课，我提过在我们的代码中，有不同种类的复杂度，而且我还说了对于简单的分支程序,运行这种程序需要的总体时间,大体上，是和指令的数目相关的,因为每个指令只会被执行最多一次。
-
Times were different in those days.
程序运行了很长时间然后停止了。
应用推荐