So, what we're saying is that we have n equals to 4, and m sub I being equal to negative 2.
我们说的是n等于4,ml等于-2
It turns out there's a new function strlen S-T-R-L-E-N that you probably have not used yet called strlen, S-T-R-L-E-N, programmers early on and still like to be succinct but communicates sufficiently what they mean.
结果这里有个新的函数,你可能没有使用过,叫做,早期的和现在的程序员喜欢简洁地,但是能充分的传达他们的意思。
PROFESSOR: OK. We can have n 4, l 3, and then, sure, we can have m sub l equal negative 2 if l equals 3 What's the second value of l that we can have?
教授:嗯,我们有n4,l3,然后我们有ml等于-2,如果l等于3,l可以有的第二个值是多少?
So I have n operations log n times, n log n there we go, n log n. Took us a long time to get there, but it's a nice algorithm to have.
所以我log,n遍的n次操作,就得到了,虽然花了不少时间得到了这个结论。
You have n branches on the tree and you count the number of leaves and sum them up.
一共有n根树枝,你数了叶子的数量然后把他们加起来
And finally up here we have n equals infinity.
最终我们让n等于无限大。
But the nymphs in all of their sensuous beauty, with "flow'r-inwov'n tresses," they have to experience the same fate.
但是年轻女神很美丽,但头发被扯断了“,她们不得不经历同样的命运。
If we have n equals 4, what is the highest value of l that we can have?
如果n等于4,l的最大值是多少?
Up here I have n over two operations of size two. Up here I've got n over four operations of size four.
最下面有n个规模为1的操作,接着上面有n/2个规模为2的操作,再上面有n/4个规模为4的操作。
ml=-2 So let's say we have n equals 4, and n sub l equalling negative 2.
这里n等于。
So, now we have n = 3 and in the chart are stocks, bonds, and oil.
图表里n=3表示,股票,债券和石油这三类资产。
On the other hand, we've seen n that if the size of a is n, that's to say, we have n elements to choose from, then the number of possible subsets is 2 to the n.
另一方面,我们看到,如果a集合的大小是,也就是说我们有n个元素可供选择,而可能的子集的元素,个数就是2的n次方。
n And these are known as anions. It has the n, which might conjure up negative, or anion and minus both have five letters.
这些就是负离子,有,能让我们想起,负,这个字,或者负离子和负号都是5个字母。
n l m s Once we have chosen a certain mix of n, l, m and s, it is used once for that particular atom.
一旦我们选定了一组量子数,它就只能被一个固定原子所有。
So in other words, every time I merge the point that I kept emphasizing verbally there and that I'm only touching each number once, means that we have to account for the amount of time it takes to merge N which is going to be just N. Now, this is again one of these cyclical answers.
换言之,之前在做合并时,我不停地强调,对每个数字我只碰了一次,这就是说,我们要记录合并所花的时间量,也就是这里的,这又是一种循环性的答案。
And this is now consistent with my claim that I have sorted a list of size N equals 1.
这与我之前所说的是一致的,我已经将N为1的一个序列排好了序。
应用推荐