It also demonstrates how the recursion of the function execution works.
这也解释了函数执行的递归是如何实现的。
For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.
对刚开始接触计算机编程的人而言,这里有递归的一个简单定义:当函数直接或者间接调用自己时,则发生了递归。
Known as lambda calculus, it was designed to investigate the function definition and application, as well as the concept of recursion.
它被称为lambda演算,用于研究函数定义与应用程序以及递归概念。
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.
因为我提出的这种算法使用了,递归的思想,这是上周课程的最后,所提出的一个术语,上次的课程中,递归是指,函数的自我调用。
应用推荐