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级别的算法,但是我们在搜索方面可以做的更好吗？

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

So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?

因此一个输入为N的问题的运行时间,在这儿的公式表示为，如果输入为N，那么此算法的运行时间,是多少呢？

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

I mean, you'll play with it in great-- with great delight this semester, you will see that backslash N is the standard in any text file for creating what we know as new line characters.

我是指，这学期，你们会很高兴-,和它打交道，同时你们也会看到,在任何文本文件里，反斜杠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是什么呢？

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