And the third thing I need to decide is how do I combine? You know, point out to you in the binary search case, combination was trivial. The answer to the final search was just the answer all the way up.

第三个问题是我需要决定如何进行合并？,就你们所知的，在二分查找中所打印出来的,合并的过程是非常简单的,最后查询的结果,就是一路上来所以的结果。

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

But part of the process of being systematic is not assuming that I'm going to get a lucky guess. But not even thinking really hard at this point. But just pruning the search space.

但是系统化的过程是不允许,假设我做出了,一个幸运的猜测的,而是逐步缩小搜索空间。

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

In binary search-- ah, there's that wonderful phrase, this is called a version of binary search just like you saw bin-- or bi-section methods, - when we were doing numerical things- in binary search, I need to keep track of the starting point and the ending point of the list I'm looking at.

就是当我们处理数字的时候，所称的二分检索，在二分法搜索中,我需要记录区间的开始点和尾点，初始化的时候就是-,问题输入的开始点和尾点，当我开始做测试的时候,我想要做的就是去取中值点。

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