Count the number of primitive operations in each step.

数一数每一步中的基本操作,好的，如果我们看看这段代码。

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

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.

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

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

We're checking the end test and incrementing, actually I was going to, I commented that out for a reason you'll see in a second, but I, normally I would keep this on, which would let me, at each step, see what it's doing. If I ran this, it would print out each step. Which is helping me make sure that it's incrementing the right way.

对不对？进行终结测试然后递增，实际上我要，因为某些你们,马上要明白的原因我把这里注释了，但是我通常会一直这么做，这样能让我看到每一步都做了什么，如果我运行这个程序，它会在每一步都,进行显示，这能帮助我让我确信程序是,在以正确的方式递增。

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

With this, if I can assume that accessing the i'th element of a list is constant, then you can't see that the rest of that analysis looks just like the log analysis I did before, and each step, no matter which branch I'm taking, I'm cutting the problem down in half.

读取数组中的第i个元素,是个常量时间的操作的话，我也就能像以前那样得到,这个算法是对数级复杂度的分析,并且每一步不管我选择哪个区间，我都可以把问题的规模缩小一半。

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