> So now that might not have felt like the fastest algorithm but think about what you could have done with that algorithm in each iteration, much like the phonebook up front here, you literally split that problem in two because on each iteration roughly half of you were sitting down and then another half and then another half.

虽然这并不是最快的算法,但如果把这种算法每次迭代,就像刚才查电话簿一样，你便将这个问题一分为二了,因为每一次迭代后只有一半坐下来,以此类推。

哈佛公开课 - 计算机科学课程节选