So this line or these lines of code up here are arguably constant time steps to say if N is less than 2 in return, that it will always take maybe one step, maybe two steps, some number of fixed CPU cycles.

如果N小于2并返回,那么这些行所对应的代码,通常只需要执行一步，或者两步，具体数字与CPU周期有关。

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

The message I'm trying to get to here, because I'm running you right up against time, is I have to be careful about what's a primitive step.

我想说的事情是，因为我正在跟大家讲算法时间复杂度，我们需要注意一个基本步骤的定义,如果我可以假设。

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

We'll do that but let's go one step at a time.

我们会这么做,但还是让我们先一步步来

耶鲁公开课 - 博弈论课程节选

Then the first time so he came up a major third there and then quickly backed off with just a half step below it, which completely gave it a different feel.

于是开始的时候,乐曲中出现一个大三和弦,然后快速地降低了半个音,这种变化给人完全不同的感受

耶鲁公开课 - 聆听音乐课程节选

So, one thing we said last time was when we put up a model and try and draw lessons from it, we should just take a step back and say, what's missing here?

在上一讲,当我们,从一个模型中总结结论的时候,我们应该回过头重新审视一下,看看我们是不是疏漏了什么

耶鲁公开课 - 博弈论课程节选