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

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

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

So, there was a savings bank movement, which spread from the U.K. To the U.S. in the nineteenth century and it was a philanthropic movement.

于是便有了一场储蓄银行的运动,这股风在19世纪从英国刮到了美国,这也是一场博爱运动

耶鲁公开课 - 金融市场课程节选

In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.

复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。

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

But it wasn't --the point was, it was the same scandal that we saw in the U.S., U.K., Germany and now France; it was the same source.

要点是,这与发生在美国和英国的丑闻一样,现在又发生在法国,它们都是源自同一事件

耶鲁公开课 - 金融市场课程节选

Yeah. You're jumping slightly ahead of me, but basically, I'm done when this is equal to 1 right? Because I get down to the base case, so I'm done when b u is over 2 to the k is equal to 1, and you're absolutely right, that's when k is log base 2 of b.

因为这就是最基本的情况了，因此当b/2的k次方等于1的时候就停止了1,你说的太对了，就是k等于b的以2为底的对数的时候,你们都坐的挺靠后的啊，我不知道是不是我讲的不太明白？

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