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开始，然后是。

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

Now, it's kind of a cyclical argument here because how do you sort the left half of N elements?

在这儿有点循环的意思,那么如何对N个元素中的左半部分进行排序呢？

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

If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?

如果我用归并排序算法，对N个元素其运行时间，就等于此算法一半元素的运行时间,另一半的运行时间，再加上N，这个N是什么呢？

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