merge sort

基本解释

20 minutes: Coding question. For example, implement merge sort
接下来的20分钟：编程的问题。例如，如何实现合并排序。
We like the simple answer two readers came up with: Merge Sort for sorting.
目的是考察被面试者的创造性。我们倾向于两位读者给出的简单答案：用归并排序法（Merge Sort）排序。
OK, what I would like you to see is I've been printing out, as I went along, actually let's back up slightly and look at the code. There's merge sort.
好的，我想让你们看就是我运行过后,打印出来的结果，我们再回头看一下这段代码,这就是归并排序，输入一个列表。

Let's do selection and let's do merge sort here on the right just to see what actually happens.
中间进行选择排序，右边进行归并排序,看看会发生什么。
哈佛公开课 - 计算机科学课程节选
Run merge sort on those. By induction, if it does the right thing, I'm going to get back two lists, and I'm going to then merge Them together. Notice what I'm going to do.
在这些上面再运行归并排序，根据归纳，如果这样是正确的,我将重新得到两个列表,然后我会把它们合并在一起。
麻省理工公开课 - 计算机科学及编程导论课程节选
It at least does corroborate the claim that merge sort N*log N as we argue intuitively is in fact, N log N in running time.
但这至少证实了归并排序,的时间复杂度为。
哈佛公开课 - 计算机科学课程节选

That quibble aside, don't expect this clash of aesthetic ideals to merge into any sort of ergonomic ideal.
ENGADGET: Sony Xperia Ion review: an Android handset with a split personality