OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.

好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。

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

I have to tell you the path, if you're going to solve a problem.

我得告诉你，如果你要解一个问题。

麻省理工公开课 - 热力学与动力学课程节选

I've got one test, I've got a subtraction, I've got a multiplication, that's three steps, plus whatever number of steps it takes to solve a problem of size b minus 1.

我进行了一次比较，一次减法，一次乘法，一共是三个步骤,再加上t的步骤数。

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

You're not going to start for the rest of your life if you ever need to solve a problem with a computer from scratch, odds are you're going to reach for some off the shelf packages or libraries or tools that other people wrote so that people like us don't have to reinvent the wheel again and again.

如果你想用Scratch来解决问题,却使用其他人写的程序,或者利用现成的资料或工具,这样以来,我们的确可以避免做重复性的工作,但却永远学不会编程。

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

Also we will have students doing workshops and problem-solving where the students will solve problems as a group, a group of three and turn in a common work sheet.

我们还有学生做研讨会,以及问题解决,从而学生可以以三人小组为单位,解决问题,最后上交平常的作业。

麻省理工公开课 - 媒体、教育、市场课程节选

We want to solve a really big problem.

我们想解决一个非常大的难题。

斯坦福公开课 - Twitter之父Jack.Dorsey演讲：好奇和灵感的力量课程节选

We'll see why they have to separate that in a minute, but they do that these lipid bi-layers solve that problem for them and they're self-assembled structures from these molecules called phospholipids.

我们马上会讲到为什么要把它们隔离开,脂质双层膜解决了这个问题,而这些自主装结构,就是由磷脂分子组成的

耶鲁公开课 - 生物医学工程探索课程节选

So you see a problem like this in the real world; you see a problem on campus you might want to solve.

在现实生活中你会遇到这样的问题;,在学校里看到这种问题时，你会想要去解决它。

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

So when you're trying to think about is this a problem that I can solve with dynamic programming, these are the two questions you ask.

所以当你想知道能否,用动态编程来解决这个问题时,你可以问自己两个问题。

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

So this is very similar, this is a kind of recursive thinking we talked about earlier, where we take our problem and we make it smaller we solve a smaller problem, et cetera.

我们则跳过比猜想数小的那个区间,然后我们重复这一过程,跟之前我们讲过的，递归思想非常类似,我们解决问题的时候,先把问题一步步变小，然后解决小问题。

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

That's a lot harder of a problem to solve if you need to reconstruct the fragmentation, yeah.

如果你需要重构这些碎片,会有很多很难的问题等着我们。

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

And the question is, so how many pigs does he have, and how many chickens does he have? Wow. What a deep problem, right? But you're going to see why we're going to use this in a second. So you know how to solve this, this is a fifth-grade problem, right?

为了避免歧义，这些猪和鸡都是健全的,现在问题是它到底有多少只猪和鸡呢？,多深刻的一个问题啊，对吗？,但是你将要看到的是,我们为什么要举这个例子,你知道如何解答这个问题？

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

There's a tendency for people to say, oh this problem's exponential, I can't solve it.

人们往往会说，哦这是个指数型的问题我没法解决它。

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

Well, this is a problem that we have solved and will solve in the weeks to come. See you Monday.

嗯，这是我们解决了的一个问题,并且将在接下来几周来解决这个问题，下周一再见。

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

So I haven't done magic, I've given you a really fast way to solve a knapsack problem, but it's still exponential deep down in its heart, in something.

所以我并没有施魔法，我已经告诉了你,一种快速解决背包问题的方法了,但是某些方面它的核心仍然是指数增长的。

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

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的时候停止分解,那是一个非常简单的对比。

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