Well, if we actually want to represent something like the number 7, well in binary, not actually in decimal like this.
如果你表达,类似于7的数字,在二进制中,它和十进制可不太一样。
It is a declaration of absolute interdependency among the things that we understand in binary terms but that we take somehow one to be causative of the other when we think about 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.
就是当我们处理数字的时候,所称的二分检索,在二分法搜索中,我需要记录区间的开始点和尾点,初始化的时候就是-,问题输入的开始点和尾点,当我开始做测试的时候,我想要做的就是去取中值点。
So just as a little sanity check, number 15 in binary would be?
再来做个测试,那么二进制中15怎样表达?
So what would be the letter A in binary inside of a computer's memory when you hit the letter A on the keyboard, for capital A?
当你敲击键盘上的字母A时,那么在计算机二进制的存储中,字母A是什么样的呢?
A patterned series of these tiny charged berries on the disk represents a single bit of data in the binary number system used by computers.
这些在磁盘上的有序的小粒子,代表这个当代计算机中,二进制中单独的一位。
And the third thing I need to decide is how do I combine? You know, point out to you in the binary search case, combination was trivial. The answer to the final search was just the answer all the way up.
第三个问题是我需要决定如何进行合并?,就你们所知的,在二分查找中所打印出来的,合并的过程是非常简单的,最后查询的结果,就是一路上来所以的结果。
If I look in the binary case, takes a little longer.
这里的输出,告诉我们。
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.
我们随意地将能指和所指捆在一起,也就是构成了一个事物和声音形象的关系,而且他们能被排列成话语。
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.
因此被称为分治的原因就这么简单,将一个问题分解成一些子问题,并希望这些子问题解决起来比较方便,正如你希望的,求解的过程也会变得简单,下面就是把结果合并起来,现在,在二分搜索的例子里,从某些方面来说,这有点微不足道。
Right, in the binary case, bam.
所花费的步骤数是一样的。
to the n, every value in the 1 bit vector we looked at last time is either 0 or 1. So it's a binary n number of n bits, 2 to the n.
从2到n,我们上次看到的,位向量的每个值不是0就是,所以它是n,比特的二进制数,从2到。
应用推荐