-
As Heidegger points out in this passage, that's a thought experiment which, if it can be done at all, derives from that prior knowledge.
海德格尔在文章中指出，这个思想实验，在可以实现的前提下，来源于之前的知识。
-
the developed world helping the... the developing world achieve those goals at the same time.
发达国家帮助发展中国家一起实现那些目标。
-
You will be able to infer from some of our code how in fact you can implement some more sophisticated programs.
你可以从一些代码中推断出,应该要怎样实现一些较复杂的程序。
-
Salvation is available,and with it immortality, but it comes from God and it doesn't come in the world in which we live, but in some other world to be achieved in the future.
人可以被救赎而不朽,但只能依靠上帝,这在我们生存的世界里是不能实现的,但也许在将来某个世界中能够实现
-
You make a life plan, what you want to accomplish in your life, and well, obviously enough, some of us will die too soon, not just in terms of, "oh, well, life still could've had good things," but too soon in terms of you didn't get where you wanted to get in terms of your life plan.
比如你订了一个一生的计划，写下你一生想实现的事情，显而易见我们中有些人会死得太早，死得太早并不是说，生活还有美好的事情“,死得太早是因为,你还没有实现你的人生计划。
-
I'm using it as an abstraction, saying I'm going to have square root from somewhere, maybe I'll build it myself, maybe somebody gives it to me a s part of a library, so I'm burying the details inside of it.
我把这个方法作为一个抽象来引用，意味着我将会从另外一个,地方去求一个数的平方根，可能我会自己写这个方法,也可能我会从别人写的lib中去引用,因此我将实现的细节放到了其他地方。
-
So, the curious thing about recursion is that pretty much always can you implement this idea of doing the same thing again and again and again but with smaller bytes each time.
可见，递归算法中新奇的一点是,为了实现一个想法,你可以一遍又一遍地做相同的事情,但每次的规模都会有所减小。
-
Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.
我们从前面的动画中可以看到,这个归并排序算法在计算机上实现之后,绝对比其他算法更快。
-
And so for the standard edition will you be implementing the mechanics of this game so that you can in fact play against yourself.
在标准版中，你可以为,该游戏实现这样的机制,这样，你就可以和自己对打。
-
N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.
但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。
-
Because what you don't see in this file is any code a that actually says put a letter of the alphabet at the top left hand corner of the screen and then put the next character to the right in other words, I'm taking for granted at this moment in time that my computer knows how to print something to the screen.
就是这些你在本文件中看不到的一些代码,实现了将首字母,放在屏幕的左上角,然后把其他字母加在其右边，我想当然地认为,我的电脑知道如何打印相应信息到屏幕上。
-
It says, well I'm going to print out first and last just so you can see it, and then I say, gee 2 if last minus first is less than 2, that is, if there's no more than two elements left in the list, then I can just check those two elements and return the answer.
然后它计算了尾点和开始点的差,如果小于2的话,也就是说数组中的元素小于等于，我对这两个元素进行比较,然后返回结果就可以了，否则的话，我们就去寻找中值点，注意它是怎么实现的,首先这个指向一个列表的开头。
-
One of the inputs to the problems we're gonna be working on this semester and if you continue on in this world how much thought it takes to implement something, how much time it takes to run something, how much space it takes to run something?
我们将在本学期集中探讨这些问题,或者在课程之后你们也可以继续研究,为实现一些功能要有多少想法，在运行过程中又将花费多长时间，需要多大的空间？
-
But what looks like this orange block as of now in Scratch, add orange to your so called inventory, well, it's gonna take at least two lines of code in C to actually create the inventory array with this first line and then put something like the word orange inside of it.
就好比Scratch里面橘色的这一块，把“桔子“加到所谓的“清单“里面去,在C语言中至少需要两行代码来实现,第一行代码创建一个货单数组,第二行就需要把“桔子“放进去。
应用推荐