What have we done over the last three or four lectures? We've started introducing you to classes of algorithms. Things that I'd like you to be able to see are how to do some simple complexity analysis.

我们在过去三节或四节课中讲了什么？,我开始向你们,介绍算法的类型,我想你们知道的是,如何做一些简单的复杂度分析。

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

This is very simple but it's a great way to ask about a specific category among many different categories.

这是个非常简单的句型，但它在询问不同种类中某一特定类型的事物时是非常理想的句型。

What kind of 课堂 - SpeakingMax英语口语达人

But notice now, those aren't just simple things like numbers, those are actually points.

但是现在请注意，这并不是像数字一样，的简单类型了。

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

In order to create any kinds of expressions, we're going to need values. Primitive data elements.

因此下一节课，Python的一些简单介绍，我们需要值或者基础的数据类型l来创建。

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

Basic idea, before I even look at the code, is pretty simple. If I've got a list that is sorted, in let's call it, just in increasing order, and I haven't said what's in the list, could be numbers, could be other things, for now, we're going to just assume they're integers.

我们可以说基本的思想是很简单的,如果我有一个排好序的数组，让我们认为这个数组是递增的吧，我并没说数组里元素是什么，可能是数字，也可能是其他的东西，现在我们假设是integer类型的数字吧，最简单的方式就是这么做了：

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