英和和英

出典:『Wikipedia』 (2011/05/26 13:40 UTC 版)

英語による解説

引用

In computing, Recursion termination is when certain conditions are met and the recursive algorithm ceases calling itself and begins to return values. This happens only if with every recursive call the recursive algorithm changes its state and moves towards the base case. Cases that satisfy the definition without being defined in terms of the definition itself are called base cases. They are small enough to solve directly.