I hope you can see this because I'm going to try and simulate what a merge sort does. I've got eight things I want to sort here, and those initially start out here at top level.

我希望你们认真看,因为我要尝试着模拟出归并排序的操作过程,这里我有八个元素进行排序,第一步是将它们分成两半，对吗？

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

Semi-torture for a pigeon.

在对鸽子的"半酷刑"后

耶鲁公开课 - 金融市场课程节选

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的列表？

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

You click there, and you have to pay attention to how many services you have of something, because if it says that a serving is three-quarters of a cup and you ate a cup and a half, then the program has to recognize that or it won't be able to make an adequate judgment of what you're eating.

点击那里,大家还要注意,每种食物摄入了多少份,如果一份指四分之三杯,而你吃了一杯半,那么系统应该判断出是两份,否则它无法对你所吃的东西做出充分判断

耶鲁公开课 - 关于食物的心理学、生物学和政治学课程节选