• He likes to be in situations where he can talk at length about what the parts are of an issue."

    VOA: standard.2010.01.16

  • Therefore, for simple branching programs, the length of time, the complexity the code, is what we would call constant.

    因此,对于简单的分支程序,运行的时间长度,算法的复杂度,也就是我们说的常数。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • So it's certainly at least linear in the length of the list. For each starting point, what do I do?

    它至少是线性的计算列表的长度,每次到了循环开始的点?

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • And what he said was that when you get down to atomic length scales there are limits, there are constraints on our ability to observe.

    讲的就是,当你去进入到原子长度的尺度中,我们的观察能力,有一定的限制条件。

    麻省理工公开课 - 固态化学导论课程节选

  • And we can also talk about the bond length, so we might be interested in what the bond length is, what the distance between these two nuclei are.

    另外一点就是键长,我们对键的长度也感兴趣,也就是两个原子核之间的距离。

    麻省理工公开课 - 化学原理课程节选

  • Then next to that north-south central hill country, you've got also running north to south, what we call the Great Jordan Rift Valley It goes the entire length of the country And the Jordan River runs through this valley.

    靠近这个中心分布着南北走向山丘的国家,你看到,南北走向山谷,被称作约旦大裂谷,它贯穿整个国家的南北,约旦河流过这条裂谷。

    耶鲁公开课 - 旧约导论课程节选

  • Even though there's four bytes the length of the string is consistent with what a human being would interpret as the length 3 of the string which is 3.

    即使那里有4个字节,字符串的长度,与我们所认为的长度是一致的,字符串的长度是。

    哈佛公开课 - 计算机科学课程节选

  • What does that opportunity of length provide us?

    时间长有什么好处呢?

    耶鲁公开课 - 聆听音乐课程节选

  • And in fact if I go off and run this, OK, what I was printing here was s 1 dot length, and that's -- What is it doing?

    他们就是一些有结构的实例,实际上如果我去运行下这个,好,我这里输入的?

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • Because if you did what I suggested with the list, the time to look up the key would be linear in the length of the list. You'd have to look at each element until you found the key.

    字典是用一种很神奇的,叫做散列法的算法,来实现的,后面我们将,会学到一点关于。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • So when I do the analysis, I want to think about what am I doing here, am I capturing all the pieces of it? Here, the two variables that matter are what's the length of the list, and how many times I'm going to search it?

    这里,要关注的,两个变量是列表,的长度以及我要搜索的次数,这种情况下,这个算法赢了?

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • Constant. Ooh, constant says, no matter what the length of the list is, I'm going to take the same amount of time.

    这个算法用的时间是相同的,我不这么认为,如果我们创建一个十倍于以前大小的数组。

    麻省理工公开课 - 计算机科学及编程导论课程节选

  • Yeah. Log. It's a good think, but why do you think it's log? Ah-ha. It's not a bad instinct, the length is getting shorter each time, but what's one of the characteristics of a log algorithm? It drops in half each time.

    对了,对数,这是个好想法,但是你们为什么认为是对数呢?,啊哈,这样的本能不错,每次长度都会缩小些,但是对数算法的特性是什么。

    麻省理工公开课 - 计算机科学及编程导论课程节选

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定