Yeah, it's kind of simple, but it gives me an ordered list of these things, And let's run it. OK.

让我们来运行运行吧，好，我会先去搜索一些数组中没有的元素，让我来试试，看-1在不在这个数组里。

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

And I want to show you a little bit more detail of that, so let's create a simple little list here.

我还想给你们再讲详细些,那让我们来创建一个简单的列表吧。

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

So, I wrote some very simple software to receive an email from my BlackBerry and then send it out to an email list of some people I put on that list, with my friends and my family on it.

所以我编写一些很简单的软件,来接收我的黑莓手机发来的邮件,然后将其转发给一个邮件列表，这个列表上有我的朋友和家人。

斯坦福公开课 - Twitter之父Jack.Dorsey演讲：好奇和灵感的力量课程节选

Is it one basically? In which case, just return a copy the list. That's the simple case.

是最基本的情况吗？在这种情况下,仅仅返回一个列表的拷贝，这是简单的情况。

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

I think the easiest way to look at what this does, is let's take a really simple example- I want to make sure I put the right things out- I've got a simple little list of values there.

到底做了什么，就是让它跑一个简单的例子，我想要确信我找到了正确的元素-,这里我用一个简单的小的列表-,如果我去代码里面看。

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

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类型的数字吧，最简单的方式就是这么做了：

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