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

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

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

It's says find the mid-point and split the list in half. Copy of the back end, sorry, copy of the left side, copy of the right side.

找到列表的中间节点,然后在这里将列表分解成两半，后端的拷贝，左部分的拷贝，右部分的拷贝。

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

Log n Log n, because at each stage I'm cutting the problem in half. So I start off with n then it's n n/2 n/4 n/8 over two n over four n over eight.

因为总共有多少层？,因为在每一层，我都是把问题分解成两半,因此以n开始，然后是。

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