-
So here's the pneumonic I mentioned for writing the electron configuration and getting those orbital energies in the right order.
这里是我提到的,对于写电子构型,和以正确的顺序得到轨道能量。
-
All right? Because if I don't do any swaps on a pass through the algorithm, then it says everything's in the right order.
好么？因为如果我,这一遍没有做任何交换，那么就意味着已经排好序了。
-
So each respectively, this is sorted 1 and 2 respectively 4 and 5, this is sorted but clearly they are not in the right order.
分别地，1磅和2磅的是有序的，同样4,4磅和5磅的也是有序的,但显然它们的顺序并不正确。
-
If God gathers up all those small molecules, that had composed my body, reassembles them in the right order and put these calci molecules next to that hydrogen molecules, so forth and so on, reassembles them in a right way.
如果上帝重组了所有构成我肉体的，微粒分子，将它们以正确的次序重组,把大量的钙生分子和,氢分子放在一起，组合起来，将它们以对的次序重组。
-
All right, so the bonding order, you're correct, should be 2, if we subtract the number of bonding minus anti-bonding electrons and take that in 1/2.
好，你们是对的，键序为，如果我们用成键数,减去反键数除以2。
-
It will wash away and so you got to pick the right materials in order to build a bridge.
它可能会被水冲走,之后人们就会选择更好的材料,以造出了更为坚固的桥
-
Right behind him in perfect order; the biggest guys in the back, go ahead.
站在他后面,对齐,大个子到后面
-
You may know from reading food labels that these ingredients in any food label are listed in order of how much there is in the food itself, so sugar comes right after peanuts.
看看食品标签你就会知道,食物配料都列在食品标签上,以它在食品中的含量多少的顺序排列,所以糖的含量仅次于花生
-
By "Present," We mean-- we will pick some part of the universe we want to study and we will ask, "What information do I need to know for that system at the initial time, like, right now, in order to be able to predict the future?"
我们所说的"现在",意思是,我们会选取客观世界某一部分来进行研究,然后我们就会问,我们需要什么信息去了解,初始时刻的系统,比如现在,进而能使我们能够预测未来呢
-
So I merged them. It's now in the right order, and that's coming from right there.
所以我把它们合并了，现在的顺序是正确的。
-
OK. What would you guess the order of growth here is? Yeah. Why? Good. Exactly. Right?
如果没听到答案的同学,答案是对数级的？
-
We said each of the merge operations O was of order n. But n is different. Right?
注意这里发生了什么,我们说过每一次合并操作的复杂度都是？
-
Just as in grade school when you're doing division and multiplication, you do it from left to right in terms of order of operations.
正像是在小学你做除法和乘法的时候,你毫不含糊地从左到右,按顺序做运算。
-
But what was really needed in order to do this was a defined preparation, right?
为了给每个人带来相同的免疫效果,我们需要精准的疫苗制剂
-
If, in fact, a gold nucleus was this size here, we would need to use another lecture hall in order to find a place to put this nucleus right here.
那么这个实验就太诡异了，所以我们决定,把距离压缩一下，我们要考虑到这一点。
-
He took the Democratic Party to the right, i.e., towards the center in order to pick up those central voters and win.
他将民主党向右翼靠拢,也就是说变得中立,以此来拉拢中间选民并获胜
-
All right. Nonetheless, even with this change, what's the order growth for bubble sort?
好的，不管怎么样，尽管这发生了，冒泡排序的增长率是多少呢？
-
Right. Order of growth here.
你们是怎么想的？
-
All right. In order to deal with this, let me show you an example, and I hope that comes up, great.
好，为了说明这些内容，让我们来看个例子，我希望这能出来。
-
In a moment, I'm gonna drag and drop in order to induce this right to do something.
一会，我要拖拽这些东西,来进行一些操作。
-
Good programming style. All right? Things that we ought to do, as you put these pieces together in order to give you really good code.
优秀的编程风格，对不对？,为了得到真正优秀的代码,我们在把代码放到一起的时候。
-
This is a game where you get a little plastic device, it's got 15 plastic numbers on it and one hole in this little plastic board and you can move those numbers up, down, left to right, and the goal is to take what's a random assortment of tiles and arrange them in numeric order and that's one of these little things you can play sort of absentmindedly.
在这个游戏中，你会拿到一个可塑的装置，上面有15个数字和一个孔,你可以将数字上下移动，左右移动，目标就是,拿到一个随机的组合后,将其按数字顺序排列,这个你可以随便玩玩。
-
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次方次,如果先排序后搜索。
-
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的操作,那个这棵有多少层呢？,这是一个除法，不是吗？
应用推荐