-
He lived in the double log cabin on the side of the mountain.
VOA: special.2009.11.14
-
And realize too, as we say on this home page here, by default, we anonomize you when you log into this bulletin board, whereby, you're all logged in as quote unquote students.
并且认识到，像我们说的这个主页，默认情况下，当你登陆这个电子公告牌，我们禁止你们，都匿名学生登陆。
-
And with this data, where students were able ; to implement last year their own E-trade-like website; whereby you have accounts and you log in your hand age of your users 10,000 virtual dollars and with them can they get stock quotes, by stocks, sell stocks and the like, all of this accomplished just after a few weeks time.
通过这些数据,学生们就可以做出类似电子商务的网站;,只要你有账号就能进入你的账户,里面有1万的虚拟美元,这样你就能去查询股票报价,进行买卖股票之类的事,这一切仅仅用了几个星期的时间就完成。
-
In fact,it would be as easy as "falling off a log".
VOA: special.2009.06.07
-
It would be nice if it was less than linear, but linear is nice because then I'm going to get that n log in kind of behavior.
那么就是一个不错的算法，但是线性方案也是很好的,因为我需要做n次的log级的行为。
-
His big home in Ohio became a log cabin.
VOA: special.2009.01.22
-
Now hopefully you're keeping a sheet of paper with you and you're writing down what you eat so you don't forget everything, and then you sit down at your computer at the end of the day and you log it all in.
希望你们可以随时带张纸,以便随时记下,吃的东西以防忘记,然后坐在电脑前,在一天结束时输入电脑
-
On May fifteenth, just seventeen days after leaving New York, Captain Creesy wrote this in the Flying Cloud's log: "We have passed the Equator in two days less time than ever before.
VOA: special.2009.12.23
-
It's an example of a very common tool that's going to be really useful to us, not just for doing search, but for doing a whole range of problems. That is, in essence, the template the describes a log style algorithm.
不仅仅是做搜索,还可以解决一整类问题,本质上，这个模板就描述了,对数形的算法,我们一会再回来。
-
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.
但这至少证实了归并排序,的时间复杂度为。
-
Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.
这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。
-
In the log case, it's divide by an amount.
而在对数算法中。
-
Yeah. Log. It's a good think, but why do you think it's log? Ah-ha. It's not a bad instinct, the length is getting shorter each time, but what's one of the characteristics of a log algorithm? It drops in half each time.
对了，对数，这是个好想法,但是你们为什么认为是对数呢？,啊哈，这样的本能不错，每次长度都会缩小些,但是对数算法的特性是什么。
-
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呢？
-
Cut the problem in half. Cut the problem in half again. And that's a typical characterization of a log algorithm.
是每次除以特定的量,将问题减一半，再减一半,如此，这就是对数算法的典型特性。
-
OK. So this is, in fact, log. Now, having said that I actually snuck something by you.
就是对数次,我已经教给你们一些。
-
OK. There's some constants in there, but this is order log b.
对数级的，这太重要了，接下来我要给你们看个例子。
-
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级别的算法,但是我们在搜索方面可以做的更好吗？
-
Log n Log n, because at each stage I'm cutting the problem in half. So I start off with n then it's n n/2 n/4 n/8 over two n over four n over eight.
因为总共有多少层？,因为在每一层，我都是把问题分解成两半,因此以n开始，然后是。
-
k * n m plus k all times log n is in general going to be much better than k times n.
在普遍情况下要远远好于,实际情况要取决于n和k的取值。
-
And if you ask the TAs in recitation tomorrow, they'll tell you that you see a lot of n log n algorithms in computer science.
如果你明天在复习课上问助教的话，他们会告诉你在计算机科学中,存在着非常多的n，log，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的时间去对其进行排序。
-
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时间搜索,啊，哪一种更好呢？恩，呵呵。
-
Once I have it sorted I can search it in log n time, but that's still isn't as good as just doing n. And this led to this idea of amortization, which is I need to not only factor in the cost, but how am I going to use it?
一旦对其完成排序,就可以在log，n的时间内对其完成搜索,但是这样做仍然不如n的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素？
-
And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.
这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n，log，n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。
应用推荐