-
RT2 So it's R T2, right, now we're at a lower temperature times log the log of V4 over V3.
等于，这时温度比刚才低,乘以。
-
Cut the problem in half. Cut the problem in half again. And that's a typical characterization of a log algorithm.
是每次除以特定的量,将问题减一半，再减一半,如此，这就是对数算法的典型特性。
-
We have a very, very strong discipline within the company, which is now 72 people, to log everything, to measure everything and to test everything.
我们公司内部,有很强的纪律性，现在公司已经有72人，负责记录一切，衡量一切，测试一切。
-
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 if you look at this series, the series log of one, what is the series expansion?
如果你们看这个式子，它的对数分之一，它的指数是多少？
-
The integral of one over a quantity is the natural log.
这种形式的积分结果,是自然对数。
-
It'll say is this really what you ate, and if you ate it, then you say yes I ate this, and then it adds to the electronic log.
系统会问这是否确实是你吃的,如果确实是 就选择是,你的选择会被记入电子日志
-
A number of men, as one historian has written, I think quite effectively, "Mounted from log cabin to mansion" and I quote "On a stairway of cotton bales accumulating slaves as they went."
一些人就像一位历史学家写的那样,我觉得非常犀利,引述一段,"小木屋通往大厦的阶梯正是由,奴隶们用棉花包堆积成的"
-
For example, this is x=t, x=t^, you're going to have x=sin t and cos t and log t.
例如,这是x=t,x=t^,你还会遇到正弦,余弦,对数函数
-
A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.
对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。
-
We started off talking about binary search, and I suggested that this was a log algorithm which it is, which is really kind of nice.
我告诉了你们这是一个对，数级的算法，这是很棒的,我们来一起看看这个算法到底做了什么。
-
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.
不仅仅是做搜索,还可以解决一整类问题,本质上，这个模板就描述了,对数形的算法,我们一会再回来。
-
and we like log algorithms, because they're really fast. A typical characteristic of a log algorithm is a pro-- or sorry, an algorithm where it reduces the size of the problem by a constant factor.
并且我们也很喜欢对数算法,因为它很快,对数算法的典型特性是高速，哦，抱歉，是他能以常数因子的速度,降低问题的大小，很明显。
-
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.
但这至少证实了归并排序,的时间复杂度为。
-
log So that's just the log of V2 over V1.
因此就是。
-
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呢？
应用推荐