-
The basic idea is, you take a guess and you -- whoops -- and you find the tangent of that guess.
首先取个猜想数,然后，嗯,去取猜想数那儿的切线。
-
The exception is right there. It's an index error, that is it's trying to do something going beyond the range of what this thing could deal with.
但他事实上抛出一个异常，异常就在这里，这是一个下标错误,它是试图去取超出范围的元素造成的。
-
And then further you put some recording device, which in those days was a photographic plate, far across a room. So you take a tiny, tiny angle and you go far enough across the room.
接着放一些记录设备，那时用的是一个摄影用的感光片，取一个极小极小的角度,然后去到房间中足够远的地方。
-
How many of you-- I was walking with a student over to my office after lecture the other day to get some material to him.
你们中有哪几位,前些天我和一个学生在课后,一起去我的办公室取材料
-
I've got to focus for a second just to get it.
等我去取一下
-
"The supreme power," By which Locke means the legislature, "Cannot take from any man any part of his property without his own consent, for the preservation of property being the end of government and that for which men enter into society, " it necessarily supposes and requires that people should have property."
最高权力“,这里洛克指的是立法机关，“未经本人同意，不能取去任何人财产的任何部分，因为，既然保护财产是政府的目的,也是人们加入社会的目的，这就必然假定而且要求人民应该享有财产权“
-
But then they posed a different version of the same question and the different version was: Suppose you had ordered tickets to pick them up and pay for them at the window at the concert hall and you brought $400 in cash in your pocket.
然后，他们又对同样的问题,给予了不同的假设场景：,假设你预定了两张票,你得去音乐厅的窗口,付钱然后取票,你随身带了四百美元。
-
And unlike n, l can start all the way down at 0, and it increases by integer value, so we go 1, 2, 3, and all the way up.
不像n，l可以从0开始取，然后每次增加一个整数，所以我们可以去1，2，3，一直下去。
-
If I do this, try and get the 10th element of a list that's only eight long. I get what looks like an error, but it's actually throwing an exception.
如果我来这么做,试着去取长度为8的列表的第十个元素,我貌似能得到一个错误。
-
So what would I want to do? I'd like to somehow walk down each of the digits one at a time and add them up. Ah, that's a looping mechanism, right? I need to have some way of walking through them.
去取这个数的,每个数字然后把他们加起来,啊，这是个循环机制对不对？,我得找到一个遍历它们的方法,一种简单的方法可能。
-
In binary search-- ah, there's that wonderful phrase, this is called a version of binary search just like you saw bin-- or bi-section methods, - when we were doing numerical things- in binary search, I need to keep track of the starting point and the ending point of the list I'm looking at.
就是当我们处理数字的时候，所称的二分检索，在二分法搜索中,我需要记录区间的开始点和尾点，初始化的时候就是-,问题输入的开始点和尾点，当我开始做测试的时候,我想要做的就是去取中值点。
-
Hmm. Well, wait a minute. If I want to sort a list, I'll take one element, I've got to look at probably a lot of the other elements in the list in order to decide where it goes. And that suggests it's going to depend on how long the list is.
我会取一个元素，然后去查看列表,来决定要把那个元素放到哪里,这就意味着它依赖于列表的长度,对，这没什么说服力，但是事实上。
-
And they'll test an intermediate value near the end or near the beginning.
他们从最后或者程序的,开始处去取测试需要的中间值。
-
And when we talk about l it is a quantum number, so because it's a quantum number, we know that it can only have discreet values, it can't just be any value we want, it's very specific values.
当我们讲，l是一个量子数时，因为它是量子数，我们知道，它只能去分立的值，它不能取到所有的数，它取一些确定的数。
-
I going to come back in a second to how it actually does that, but it basically says, get me x value for p 1, get me the x value for p 2, compare them, just as you would normally.
是一个类的实例,我要去取的这个实例，所关联的x值，我稍后会讲讲实际上，这里是怎么实现的，但是基本上它的意思就是，给我p1的x值。
应用推荐