Having done that, it goes back up and picks the second sub-list, which came from there. It's a down to base case, merges it.

就是从那里得来的,完成这些后,回到上一步。

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

OK, and you can see that this thing ought to unwrap, it's going to keep extending out those multiplications until gets down to the base case, going to collapse them all together.

好，你可以看到这种方法,是怎么解决的,他一层层的将乘法展开一直到最底层,然后将他们一起乘起来。

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

I just give you one of those, right, because you could write down the other one because you know the other complimentary sequence from base pairing?

我只写了一条链的序列,因为你们能够写出另一条,因为你们根据碱基配对,就能推测出互补链的序列

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

And as long as that smaller computation reduces to another smaller computation, eventually I ought to get to the place where I'm down in that base case.

如果我不属于基础事件,那么我需要把它简化为更简单的计算，随着计算的不断简化,最终我能分解成基础事件。

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

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

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

If you do the base pairing goes exactly the same sequence backwards down here.

如果将它碱基配对,就会得到相同,但反过来的序列

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

When do I get down to the base case?

哦对，你又说到我前头去了？

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

When this gets down to t of 1, I'm in the base case.

当问题缩小到t的时候，就是最基本的情况了。

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

Yeah. You're jumping slightly ahead of me, but basically, I'm done when this is equal to 1 right? Because I get down to the base case, so I'm done when b u is over 2 to the k is equal to 1, and you're absolutely right, that's when k is log base 2 of b.

因为这就是最基本的情况了，因此当b/2的k次方等于1的时候就停止了1,你说的太对了，就是k等于b的以2为底的对数的时候,你们都坐的挺靠后的啊，我不知道是不是我讲的不太明白？

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