fork-join 方法提供了一种表示可并行化算法的简单方式，而不用提前了解目标系统将提供多大程度的并行性。

The fork-join approach offers a portable means of expressing a parallelizable algorithm without knowing in advance how much parallelism the target system will offer.

youdao

如果您记得每种状态表示一个堆栈配置，则理解算法的这一部分是较容易的。

It's easier to understand this portion of the algorithm if you remember that each state represent a certain stack configuration.

youdao

我们的评估：虽然必须维护用于生成不同数据格式的算法，但是实际的数据只需表示一次。

In our evaluation: While the algorithms to generate the various data formats must be maintained, the actual data need only be represented a single time.

youdao

So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?

因此一个输入为N的问题的运行时间,在这儿的公式表示为，如果输入为N，那么此算法的运行时间,是多少呢？

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