That got split in half, and that got split in half until I got to a list of one.

在那里被分成两半，然后在那里被分两半,直到得到长度为一的列表。

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

At each stage, no matter which branch, here or here, I take, I'm cutting down the length of the list that I'm searching in half. All right?

选的是这里还是那里,我总是把列表分成两半，对吧？,所以如果我处理一个长度为n的列表？

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