-
We started off talking about binary search, and I suggested that this was a log algorithm which it is, which is really kind of nice.
我告诉了你们这是一个对，数级的算法，这是很棒的,我们来一起看看这个算法到底做了什么。
-
OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.
好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
-
The way in which we put signs together is to take these bundles, these binary relationships between a concept and a sound image, and adjust them in an unfolding sequence.
我们随意地将能指和所指捆在一起，也就是构成了一个事物和声音形象的关系，而且他们能被排列成话语。
-
Because the two are not identical despite massive amounts of scholarship that confuses this issue: thinks holy means pure, thinks common means impure, and it just doesn't: these are different binary oppositions. The two are not identical.
因为这俩并不完全相同,还是会有很多学者会弄混它们：,认为神圣的就是纯洁的，普通的就是不纯洁的，实则不然：,它们是不同的相对关系，它们并不完全相同。
-
But at the end of the day, and here's why we just went with binary and not decimal years ago, when you have one implement a computer with a physical device, it's actually really easy to represent the notion of on or off.
但是最终，之前我们采用二进制,而不是十进制，主要是因为当我们用一台实体机器运行计算机时，这实际上很容易用开或者关的概念来表示。
-
OK. So, what do I want you to take away from this? This idea of binary search is going to be a really powerful tool. And it has this property again, of chopping things into pieces.
从这里学到些什么？二分查找的思想,是一个非常有用的工具,我重复一遍，把问题拆成几部分来解决,那事实上，这里的增长率是多少？
-
I'm narrowing it down. It's getting a little silly but you know I'm going to really be persistent and just follow the rules here of binary search, rather than jumping to conclusions.
按照二分法的规则来做的,而不是直接得出某种结论,很明显这儿我的目的是什么？,显示这两个相同的东西。
-
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.
就是当我们处理数字的时候，所称的二分检索，在二分法搜索中,我需要记录区间的开始点和尾点，初始化的时候就是-,问题输入的开始点和尾点，当我开始做测试的时候,我想要做的就是去取中值点。
-
Voice and writing, by the way, are not a stable binary.
顺道说一句，声音和文字不是稳定的二元系统。
-
And it's called divide and conquer for the obvious reason. I'm going to divide it up into sub-problems with the hope that those sub-problems get easier. It's going to be easier to conquer if you like, and then I'm going to merge them back. Now, in the binary search case, in some sense, this is a little bit trivial.
因此被称为分治的原因就这么简单,将一个问题分解成一些子问题,并希望这些子问题解决起来比较方便,正如你希望的，求解的过程也会变得简单,下面就是把结果合并起来,现在，在二分搜索的例子里,从某些方面来说，这有点微不足道。
-
We're going to call binary search, it's going to take the list to search and the element, but it's also going to say, here's the first part of the list, and there's the last part of the list, Well, it checks to see, is it bigger than two?
我们将要调用这个二分查找,它将会在列表里面搜索元素，假定这里是，列表的第一个元素,那里是列表的最后一个元素，代码内部到底做了什么？
-
The so called binary system, 1 these zeros and ones that you'd probably have some vague sense underlie all computers today actually reduced to the exact same grade school kind of math and system except with computers, 1 because it's a lot easier to use just two digits, zero and one.
所谓的二进制就是，你觉得模糊的0与,在电脑上计算,事实上可以简化为跟小学数学一样,只是在电脑上计算而已，因为它更容易，仅仅使用两个数字，0与。
-
You just need to express in ASCII character, one at a time, and these brave souls are simply going to spell something out for us to hammer home this point of binary.
你们只需要每人代表一个ASCII码，这些勇敢的小伙子们就是想,清楚的让大家理解二进制原理。
-
And a bit, B-I-T, just a shorthand for binary digit, 2 so a digit of zero over a one, bi means two, you only have two digits.
比特，B-I-T，是binary，digit的简写，从0到1的数字，而bi表示，所以你就只有两个数字。
应用推荐