And what does that say? It says, let's assume I want to do k searches of a list. OK.
如果我们假定要在列表中做k次搜索,在线性的情况下,假定是一个未排序的情况。
There's a lot of places to eat and karaoke and lots of market places.
那里有很多吃饭、K歌的地方,也有很多市场。
What comes out of the math is that the value of k, there are multiple values, there are multiple solutions.
得到的数学结果是k的值,这有多种值,多种解法。
And it's, again it's a macroscopic pretty big thing so typical might be 10 kilojoules per Kelvin, and that's pretty big, right?
相当大的数值,典型值大概,是10kJ/K,它相当大,对吧?,注意这里不是每摩尔?
You talk to these people who were standing in front of the bank; the first question you'd ask them, aren't deposits insured in the U.K.
你去银行门前,与排队的人们交谈,先问他们,英国的存款
k * n m plus k all times log n is in general going to be much better than k times n.
在普遍情况下要远远好于,实际情况要取决于n和k的取值。
It will typically look like this and the formula we say is F = - kx, where k is called "The force constant."
图像看上去一般就像这样,对应的式子是 F = - kx,k 叫做"弹性系数"
Well, the energy at infinity is zero -K and the energy in the ground state is minus K.
无限远处的能量值为,而基态能量值为。
What it meant was that the government of the U.K.
它意味着英国的政府承认。
Now what actually developed in the 1700s was that the Bank of England being the most powerful bank in England started to demand that other banks in the U.K.
现在,真正在18世纪发展的是,英格兰银行,这个在英格兰最有权力影响的银行,开始要求英国其他那些。
So I'm done when b minus k equals 1, or k equals b minus 1.
因此b-k=1或k-b=1的时候,我就可以停下来了。
Yeah. Actually, I think I want b minus k equal to 1. Right?
对,实际上,当b-k=1的时候就该停下来了对不对?
And so redefining then the temperature scale to the Kelvin scale, where t in degrees Kelvin is equal to t in degree Celsius, plus 273.15.
以K为单位的温度,是以℃为单位的温度,加上273。15度。
Mathematically complete problem is that you can find the function x of t by saying that the second derivative of the function is equal to -k over m times the function.
这个数学问题就是,你可以求出函数 x,只要令函数的二阶导数,等于 -k 除以 m 再乘以函数
It also happened in the U.K. in the same year.
在同一年,同样的事情在英国也发生了。
The Bank of England if you were a little bank somewhere in the U.K.
英格兰银行,如果你是英国的一家小银行的话。
Now I'm in better shape, right? Especially for really large n or for a lot of k, because now in general, this is going to be smaller than that.
很大的k也大的情况,因为这样这就比这个小了,这种情况是分摊。
In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.
复杂度是多少?k的n次方,对吧?,在序列n中做搜索,要做k次,所以是k的n次方次,如果先排序后搜索。
Yeah. You're jumping slightly ahead of me, but basically, I'm done when this is equal to 1 right? Because I get down to the base case, so I'm done when b u is over 2 to the k is equal to 1, and you're absolutely right, that's when k is log base 2 of b.
因为这就是最基本的情况了,因此当b/2的k次方等于1的时候就停止了1,你说的太对了,就是k等于b的以2为底的对数的时候,你们都坐的挺靠后的啊,我不知道是不是我讲的不太明白?
应用推荐