OK, what I would like you to see is I've been printing out, as I went along, actually let's back up slightly and look at the code. There's merge sort.

好的，我想让你们看就是我运行过后,打印出来的结果，我们再回头看一下这段代码,这就是归并排序，输入一个列表。

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

Let's run merge sort on it, and then we'll look at the code.

让我们在这个列表上运行归并排序，然后我们在看一下代码。

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

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?

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

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

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.

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

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