But if it watches you over some amount of time just like it's been for years with advertisements, can this kind of algorithm, this kind of process presumably improve?

但是如果它像关注广告一样,花费一些时间关注你，这些算法和进程，想必会提升吧？

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

So as you can see, as we escalate the problem difficulty, the difference between the good method and the not quite as good method gets bigger and bigger and bigger.

如你所见，当我们处理更复杂的,问题的时候，优良的算法,和并不那么好的算法之间的,差异会变的越来越大，这一点很重要。

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

So don't get too caught up in understanding the methods or statistics in a particular study or anything like that.

所以没必要过于纠结,非要去理解,某项研究的分析和算法

耶鲁公开课 - 关于食物的心理学、生物学和政治学课程节选

So I propose this algorithm, this program, this process for counting people in this room.

因此我提出了这种算法，这种程序和处理方法,来计算教室里的人数。

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

So this is a nice little search-- sorry, a nice little sort algorithm . And in fact, it's relying on something that we're going to come back to, called the loop invariant.

恩，这是一个很棒的小搜索，抱歉，和很棒的小排序算法，事实上，它依赖于一些我们要回顾的东西,被称作循环不变量。

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

All right? I don't care what's in there, but just assume that's my list. And just to remind you, on your handout, and there it is on the screen, I'm going to bring it back up, there's the little binary search algorithm.

好，我不管列表里是什么，就假定那是一个列表,要提醒你们的是,在你们的讲义上和屏幕上，有一个简单的二分查找算法。

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

OK. Today, for the rest of the lecture, we're going to take a break from the topic of algorithms, and computation, and things of the sort. And do something pretty pragmatic.

好，今天剩下的时间里，我们不再讲算法，计算和排序这些话题了,我们会做一些非常实用的事,我们主要的讲讲测试。

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

We've already spent a fair amount of time this semester talking about searches.

我们这个学期已经花了,很多时间来讲搜索和搜索算法了。

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

In Week 2 we'll look at things like cryptography and functions and the tools that by which you begin to assemble solutions to problems; in Week 3 we'll introduce what are generally ; known as algorithms and data structures; mechanisms by which you can solve problems more efficiently, effectively.

第2周,我们学习加密技术及其功能,还会学到一些操作工具,通过这些工具的使用来收集解决问题的办法,第3周,我们将介绍;,算法和数据结构,以及可以更有效地解决问题的机制。

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

N log N is not nearly as good as log N. As a sanity check, what algorithm have we seen that runs in log N time?

而N，log，N和log，N并不一样，我们之前探讨过的哪个算法其时间复杂度是log，N呢？

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