"This is a duty and a right." The Goldstone Report endorsed by the U.N.
VOA: standard.2009.10.18
Right now, I'm doing rock n' roll music.
现在我玩摇滚。
We said each of the merge operations O was of order n. But n is different. Right?
注意这里发生了什么,我们说过每一次合并操作的复杂度都是?
Why didn't they keep right on going with G, H, I, J, K, L, M, N, O, P?
为什么他们不接着写下去呢,按照字母表
n Alright. So if n is less than or equal to 1, return n. Well that's not right, right?
好吧,如果n小于等于1,它会返回,这里不对,是吧?
All right, July, 1913, blow this up, so On the Constitution of Atoms and Molecules by N. Bohr, Doctor of Philosophy, Copenhagen, asterisk here, and I've blown up the bottom of the page, communicated by Professor Ernest Rutherford, F.R.S., Fellow of the Royal Society.
913年,六月,发表了,波尔博士,建立了原子分子模型,哥本哈根,星号这儿,我通过和恩内斯特卢瑟福的交流,被这页底部的所震惊了,英国皇家学会会员。
printf So thus far, the things I put David between quotes are just simple things like David or David backslash N, but what if I want to do call my self David in quotes, right?
像我们前面提到的,我们把要显示的东西放在双引号之间,譬如,或,David反斜杠n,但是如果我自己的名字本来就叫,“David“
All right, I want to do one more at homonuclear example here, and this is n 2.
好的,我想要再讲一个同核的例子,这就是N2。
Ah, n times, because for each value of i, I'm going to do that m thing, n*m so that is, close to what you said, right?
因此这就和你说的差不多了对不对?,这个问题的复杂度为,让我写下来,是-对不对,是?
N Well, here is a list of size N. How many times can you divide a list of size N by 2, right?
这是一个大小为N的列表,将一个大小为,的列表除以2需要几次呢?
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次方次,如果先排序后搜索。
Thank you. Sorry, I've got the wrong glasses on but you're absolutely right, and in case the rest of you didn't hear it, n squared.
我看不清,但你绝对是对的,你们其他人可能没听清,是n的平方。
Notice I close the quotes after I'm putting a new line-- after I'm putting this new line, name but then to the right hand side is comma name.
注意反斜杠n后面加上后引号-,后引号,再右边就是逗号。
It's gonna be zero if N is less than 2, right.
如果N小于2,T应该是。
Right. N is over here for counting from zero.
对的,从0开始计数,N到了这边。
If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?
如果我用归并排序算法,对N个元素其运行时间,就等于此算法一半元素的运行时间,另一半的运行时间,再加上N,这个N是什么呢?
There's one step inside of it. Right?
哦,n次,因为对i的每个值?
O Right there, order n. So I have order n operations at each level in the tree. And then how many levels deep am I? Well, that's the divide, right? So how many levels do I have?
在这儿,所以我在树的每个层次都要做O的操作,那个这棵有多少层呢?,这是一个除法,不是吗?
应用推荐