So, the curious thing about recursion is that pretty much always can you implement this idea of doing the same thing again and again and again but with smaller bytes each time.

可见，递归算法中新奇的一点是,为了实现一个想法,你可以一遍又一遍地做相同的事情,但每次的规模都会有所减小。

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

Because the algorithm I proposed is going to leverage this idea of recursion which recall was just a piece of jargon we tossed out at the last-- at the end of last week's lecture, last time's lecture recursion really in this context refers to the act of a function calling it's self.

因为我提出的这种算法使用了,递归的思想，这是上周课程的最后,所提出的一个术语，上次的课程中，递归是指,函数的自我调用。

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