N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.

但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。

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

If we can sort things, you know, we get this n log n behavior, and we got a n log n behavior overall. But can we actually do better in terms of searching.

如果我们可以排序，如你所知，我们有n，log，n级别的算法，并且我有一个整体的n，log，n级别的算法,但是我们在搜索方面可以做的更好吗？

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

Like what the heck have we been spending our time for-- our time on with Bubble Sort and with Selection Sort and in fact there's plenty of other N squared sorts that we're not even gonna bother looking at.

真见鬼，我们竟然在-,冒泡排序和选择排序上花时间,而事实上，还有很多我们根本都不想考虑的,复杂度为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是什么呢？

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

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.

但这至少证实了归并排序,的时间复杂度为。

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

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

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

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

I know it's gonna take me a lot of work on the order of N squared steps to sort these things.

要对它们排序就要进行大量的工作,大概需要N平方步。

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

I can tell you how to sort N elements by saying in kind of a snide way.

我可以告诉你一种方法,去对这N个元素进行排序。

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

I could still do the linear case, which is order n or I could say, look, take the list, let's sort it and then search it. But in that case we said well to sort it was going to take n log n time, assuming I can do that.

我仍然可以做O的线性搜索,或者也可以以这个列表为例，我们先将其进行排序,然后再进行查找，但是在这种情况下,要花费n，log，n的时间去对其进行排序。

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

Alright, you want me to sort N elements.

既然要对N个元素排序。

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

On the other hand, if I want to sort it first, OK, if I want to do sort and search, I want to sort it, it's going to take n log n time to sort it, and having done that, then I can search it in log n time.

我先排序，好的，如果我想排序再搜索，我要排序，这需要花n，log，n时间排序，然后做完了，我们能花log，n时间搜索,啊，哪一种更好呢？恩，呵呵。

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