Ndoungou told reporters outside the court that concerning the electoral list and the comportment of electoral officials during the process, he sees no call for further action by the court to challenge the outcome.

VOA: standard.2009.10.04

We started off with a call with that list.

我们从那个列表的调用开始。

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

So let's think about lists. So if l is a list, l sort I can call something like s dot sort, l dot sort.

所以让我们想想链表，所以如果l是一个，链表我可以调用像是s，sort的函数。

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

We're going to call binary search, it's going to take the list to search and the element, but it's also going to say, here's the first part of the list, and there's the last part of the list, Well, it checks to see, is it bigger than two?

我们将要调用这个二分查找,它将会在列表里面搜索元素，假定这里是，列表的第一个元素,那里是列表的最后一个元素，代码内部到底做了什么？

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

Let's suppose, we'll start with the list, I'll call it l 1. This, by the way, is a really bad thing I just did.

让我们假设有一个名为l1的数组，顺便说下，这真是挺糟糕的。

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

Basic idea, before I even look at the code, is pretty simple. If I've got a list that is sorted, in let's call it, just in increasing order, and I haven't said what's in the list, could be numbers, could be other things, for now, we're going to just assume they're integers.

我们可以说基本的思想是很简单的,如果我有一个排好序的数组，让我们认为这个数组是递增的吧，我并没说数组里元素是什么，可能是数字，也可能是其他的东西，现在我们假设是integer类型的数字吧，最简单的方式就是这么做了：

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