The reason is because we already have a full valence shell for our hydrogen, it doesn't want any more electrons.
原因是因为我们的氢,已经有一个排满的价壳层了,它不再需要多余的电子了。
There's a guy in about the fifth row there who's missed too much sleep, so somebody just nudge him. That's it, good.
第五排有一个同学,可能很缺乏睡眠吧,旁边的人把他叫醒吧
Again. Basic premise of binary search, or at least we set it up was, imagine I have a sorted list of elements. We get, in a second, to how we're going to get them sorted, and I want to know, is a particular element in that list..
好,二分查找的基本前提,或者是我们建立二分查找的基础,我们已经有了一个排好序的元素列表,我们就需要知道如何来快速的排序,如何从列表中找到特定的元素。
Now, if you are standing there with your -- by the way the first three rows have a chance of hitting each other.
现在,如果你站在那里用你的 --,顺便提一下前三排有机会互相攻击
Who cares if I randomly send him or her elsewhere in the array?
就算我把他或者她排在序列中的其他位置,又有谁会在意呢?
Anybody want to guess from the last row what force?
最后一排有同学想猜一下还有什么力吗
So remember, that when we talked about Lewis structure, the organizing principle behind Lewis structures is the idea that within the molecule the atoms are going to arrange their valence electrons, such that each atom within the molecule has a complete octet or full outer shell.
记得,当我们讨论路易斯结构的时候,路易斯结构所遵循的组织原则是这样一种思路,那就是分子中的原子都倾向于,重新安排它们的价电子,使得分子有一个完整的,“八隅体“或者排满的外壳层。
But there's two rows of checkers.
这里有两排方格
Let's imagine my army is the same size as theirs precisely, so that the line is the same size on both sides; therefore, also the same depth.
想象我们的军队和敌人有同样的规模,双方的每一排都具有同样的规模,当然,纵深也相同
Here's an interesting question: how wide is the line going to be?
一个有趣的问题产生了,排与排之间有多宽呢
Each of us individually has an incentive to emit carbons as usual.
通常我们每个人都有排碳的动机
In fact, if the other person is working hard, or is cutting back on their carbon emissions, you have every bit more incentive to not work hard or to keep high carbon emissions yourself.
实际上,如果其他人正在努力工作,或者正在尽量减少碳排量,你总会有想偷懒的动机,或者总是继续大量排碳
Let's assume that I could somehow get to the stage where I've got two sorted lists.
让我们来假设目前的情况是:,我已经有两个已排好序的列表。
There were previous examples of people trying to have a deep wing that would do things, but if you take me back to my primitive phalanx here about 600-650 they're not doing that stuff yet.
先前有例子,人们会在布阵时增加两翼的排数,如果再回到我这里的原始方阵,公元前六百到六百五十年的方阵,不会采取这种方式
Basic idea, before I even look at the code, is pretty simple. If I've got a list that is sorted, in let's call it, just in increasing order, and I haven't said what's in the list, could be numbers, could be other things, for now, we're going to just assume they're integers.
我们可以说基本的思想是很简单的,如果我有一个排好序的数组,让我们认为这个数组是递增的吧,我并没说数组里元素是什么,可能是数字,也可能是其他的东西,现在我们假设是integer类型的数字吧,最简单的方式就是这么做了:
So here Player I's strategy set, she has two choices top or bottom, represented by the rows, which are hopefully the top row and the bottom row.
这是参与人I的策略集合,她有上下两种选择,用横排来表示,即上下两排
应用推荐