-
They are always say 32 bits or always 64 bits they do not vary in size based on what they're pointing at.
它们总是32位或者总是64位，它们的大小不会因它们所指的,内容不同而不同。
-
The circuitous, logical route that we had to take in order to arrive at this new sense of Satan's size has everything to do with our status as temporally bound, temporally constrained readers.
我们需要经历一个迂回曲折的逻辑过程,来从新的意义上理解撒旦的高大,和我们目前处在的，作为世俗压制下的读者的地位，有着紧密的联系。
-
So at the moment left hand is at the start of this list of size 1, my right hand is at the start of this list of size 1, and now I need to merge these two lists.
现在左手手指指向这个大小为1的列表的开始,右手手指指向这个大小为1的列表的开始,现在我需要合并这两个列表。
-
So basically, at the time he was just going on size and then traits, but what we actually know today is that we can also order things in the periodic table by electron configuration.
基本上，在当时他只能通过大小,和特性来进行，但是现在我们已经知道了,我们还可以通过电子排布来对它们进行排序。
-
It says while the index is smaller than the size - of the list, I'm not at the end of the list and I don't have an answer yet, check.
当然是如果我还没检索到目标数的话,因此我会去看看是不是,这里真的看不情。
-
The truth of the matter is if you look at the technology industry, there's always a few big guys, some medium size guys, lots of small guys, and the names are always changing because the industry is so darn dynamic, and there's so much new stuff being invented.
真相是，如果你回首科技行业，人总会分为三六九等，耳熟能详的名字总在变化,因为这个行业发展实在太快了，有如此多的新事物被发明出来。
-
who will help me out？ They find themselves surrounded, and Paris is--it's nothing like- - it's one-third the size of London at this same time, or at any other time, but it has a huge circumference.
谁来帮我下,他们发现自己被包围了,巴黎成为,巴黎已经大不如前,它仅仅相当于,当时或其他时期伦敦规模的三分之一,还是一个巨大的牢笼
-
We don't seem to be doing that just yet, certainly not as badly, alright, so at this point in the story I have a sorted list of size 4.
当然现在我们不需要那样做,此时此刻,我已对整个问题中大小为4的列表排好序了。
-
The second question I want to ask is what's the base case? When do I get down to a problem that's small enough that it's basically trivial to solve? Here it was lists of size one. I could have stopped at lists of size two right. That's an easy comparison.
第二个问题是什么是基础条件？,我要将问题分解到何时才使得问题,小到可以解决的基本问题？,这里是当列表的长度为1有时候,我也可以在长度为2的时候停止分解,那是一个非常简单的对比。
-
2 6 8 1 3 7 5 If I start off with fou, two, six, eight, one, three, seven, 8 five, so my list is of size N equals 8 at the moment.
顺序如下：,现在列表的大小N等于。
-
If I'm running at nanosecond speed, 1000 n, the size of the problem, whatever it is, is 1000, and I've got a log algorithm, it takes 10 nanoseconds to complete.
如果这个问题的规模，也就是n，是，如果这个问题是对数级的，这将会占据10纳秒的时间，你一眨眼的时间。
-
And towards that end to give you a sense of the size of the support structure in place for this course, this is the size at the moment of CS50's staff inclusive of teaching fellows, course assistants, myself, as well as folks who help with our video production and the like.
为达到这一目标,我们让大家了解下这门课的辅助，在CS50进行的时候，有这么多人会给我们提供辅助支持,其中包括教学研究员，课程助理,我，以及帮助我们制作视频的等一些人。
应用推荐