"And what happens is we have mazes and the children are able to organize the robots and see if they can get them through the maze within a certain time period."

VOA: special.2010.07.28

So those of you who haven't, don't worry, I mean this will be a bit review, but we'll see it more through the eyes of Game Theory this time, and for those of you who haven't, don't worry we're going to go through it.

如果你没学过,也不必担心,我们一起来快速回顾一下吧,但这次我们用博弈论的角度去分析,那些之前没有学过的同学,别担心,现在我们一起来看一遍

耶鲁公开课 - 博弈论课程节选

But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.

但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。

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