·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
For example, implement merge sort.
例如,如何实现合并排序。
Let's run merge sort on it, and then we'll look at the code.
让我们在这个列表上运行归并排序,然后我们在看一下代码。
20 minutes: Coding question. For example, implement merge sort.
接下来的20分钟:编程的问题。例如,如何实现合并排序。
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.
但这至少证实了归并排序,的时间复杂度为。
应用推荐