I also modeled that the prerequisites list is displayed as part of the seminar details user-interface element, which is more than the use case currently calls for.

对于作为研习班细节用户界面元素的其中一部分的前提列表也进行了建模，这要比用例当前调用的内容多。

youdao

In this case, the fold operation refers to a transformation that combines each element of the list with the next one, accumulating a single result for the entire list.

在这种情况下，fold运算指的是结合列表每个元素与下一个元素的转换，为整个列表提供一个累计的结果。

youdao

Sum-factors reduces the list one element at a time, using the function (in this case, +) supplied as the first parameter on each element.

sum - factors一次减少一个列表元素，它使用函数(本例中，是+)作为每个元素的第一个参数。

youdao

So the first thing we'll do is, we'll print the element, in this case it will be a list right? Because it's a list with two lists in it.

因此这儿我们要做的第一件事，就是要显示元素，在这儿元素就是数组了对不对？,因为这个数组包含了两个数组。

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

If it's there, I'm done, if not, I keep walking down, and I only stop when I get to a place where the element I'm looking for is smaller than the value in the list., in which case I know the rest of this is too big and I can stop.

并且保持遍历,我只在当当前位置的数组元素,大于目标数时停止,这意味着剩下的元素都比目标元素大，但是其他的情况,我还是要遍历完整个数组。

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

Here's the problem. How do I get to the nth- er, the k'th element in the list, in this case?

如何找到第n个元素呢-,在这里，如何找到第k个元素呢？

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