Cape Verde graduated from the United Nations' list of least developed countries in 2007, and joined the World Trade Organization last year.

VOA: standard.2009.06.04

So it's certainly at least linear in the length of the list. For each starting point, what do I do?

它至少是线性的计算列表的长度,每次到了循环开始的点？

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

So halfway is the right thing to do, because at each step, I'm guaranteed to throw away at least half the list. Right? And that's nice.

一半以上的元素，对不对？，这很棒，好，大家猜猜这个算法的增长率是多少？,为什么？太对了。

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

Well, in giving these examples, I've already indicated at least two things that belong on the list.

在举例的过程中，我已经说明,起码有两样东西在名单上。

耶鲁公开课 - 死亡课程节选

Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..

好，二分查找的基本前提，或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表，我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。

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

As I keep moving down, that part gets smaller, it's not always the initial length of the list, and you're right. But if you do the sums, or if you want to think of it this way, if you think about this more generally, it's always on average at least the length of the list.

等等，随着移动，剩下的部分越来越小，并不是初始那么长了，如果你算一算，或者你这么想，你考虑更一般的情况，平均下来至少是列表的长度。

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