OK. That's the basic idea of binary search.

好了，这就是二分查找的基本思想。

youdao

OK. At the end of the lecture last time, I also showed you an example of binary search.

好的，在上次课程的最后，我也给你们看了一个二分查找的例子。

youdao

Based on the analysis of binary search method, a new search method is put forward.

在分析二分搜索方法基础上，提出了一种新的搜索方法。

youdao

OK. At the end of the lecture last time, I also showed you an example of binary search.

好的，在上次课程的最后，我也给你们看了一个二分查找的例子。

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

OK. So, what do I want you to take away from this? This idea of binary search is going to be a really powerful tool. And it has this property again, of chopping things into pieces.

从这里学到些什么？二分查找的思想,是一个非常有用的工具,我重复一遍，把问题拆成几部分来解决,那事实上，这里的增长率是多少？

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

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..

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

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