I've got to do another pass. Huh. Sounds like a linear number of times I've got to do- oh fudge knuckle.

冒到最后去，还得再做冒泡,呵，听起来我要做线性次的时间-,哦，胡说八道。

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

And what does that say? It says, let's assume I want to do k searches of a list. OK.

如果我们假定要在列表中做k次搜索,在线性的情况下，假定是一个未排序的情况。

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

So this isn't-- OK. And you're also close. It's going to be linear but how many times do I go through this?

每次能丢掉一半，所以这里不是-,好的，但你也很接近了,他可能是线性的，但我得遍历多少次呢？

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

Let's suppose n is 1000, and we're running at nanosecond speed.

假入我们一秒钟运算十亿次，我们已经看过了对数级，线性增长的。

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

It would be nice if it was less than linear, but linear is nice because then I'm going to get that n log in kind of behavior.

那么就是一个不错的算法，但是线性方案也是很好的,因为我需要做n次的log级的行为。

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