And if I'm walking down the list, this is probably order of the length of the list s because I'm looking at each element once.
这可能大概就是数组的长度,因为我会遍历数组中的每个元素一次,现在你可能会想,等等,数组已经排好序了。
Walk. I like to go to the zoo. As a matter of fact, I'm walking down to the zoo right now.
散步。我喜欢去动物园。其实,我现在正要去动物园呢。
If it's there, I'm done, if not, I keep walking down, and I only stop when I get to a place where the element I'm looking for is smaller than the value in the list., in which case I know the rest of this is too big and I can stop.
并且保持遍历,我只在当当前位置的数组元素,大于目标数时停止,这意味着剩下的元素都比目标元素大,但是其他的情况,我还是要遍历完整个数组。
In the very next scene, the final scene, she's walking down the hallway in the hospital and she's sort of smiling and contented, she seemed sort of hopeful.
而下一个镜头,也就是最后一个镜头,她走在医院大厅里,嘴角却流露出一丝满意的微笑,她似乎又变得满怀希望。
My favorite moral dilemma is as I'm walking down the street and I see somebody I sort of know, do I avoid eye so we don't have a conversation or do I say, "Hey. How are you doing?"
我最喜欢的道德困境是,当我走在大街上时,我看到一个不是很熟的人,我要转移视线,免得要跟他交谈吗,还是我说”你好吗?“
If these 8 million people , would correspond to the number of neurons in the brain, the equivalent of the hair cells that you could get out of a single cochlea would be equivalent to one person walking down 42nd street.
如果这八百万人,相当于大脑中的神经元数量的话,能从一个耳蜗内取出的毛细胞,就好比是,第42大街上的某位行人。
Let's say, you're walking down the street, passed a house that looks really really familiar.
假设,你正沿着街走着,路过一栋房子时,你觉得特别眼熟。
For example, let's say that you and your friend are walking down the city street.
例如,假设你和你的朋友正在街上走着。
So if I'm walking down the street and I'm feeling freezing and annoyed
所以如果我沿街散步,我会感到非常寒冷,非常烦躁,
when they'll see someone walking down the street,
当他们看到有人在街上行走,
I was walking down the street.
我正在街上走着。
He jumped from table to table, eating standing up--he didn't like to sit down very much, his back hurt--; or walking around.
在不同的桌子间窜来窜去,站着吃东西,他不怎么喜欢坐着,因为长年背痛,或者在宴席间四处走动
I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.
你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去,找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。
I'm walking down the list.
算法遍历了一遍数组。
How do I figure that out? Well I'm looping down the list, right? I'm walking down the list.
怎么算出来的呢?我在循环遍,历这个列表对吧?那要遍历这个列表。
应用推荐