Guo Xiao-hui
Abstract
The inner realization principle of recursion is discussed. For converting a recursive function into a non-recursive function, a group of rules are given. By making use of these rules, graph′s depth first search recursive algorithm and n-order Legendre polynomial recursive algorithm are (converted) to equivalent non-recursive algorithms.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The inner realization principle of recursion is discussed. For converting a recursive function into a non-recursive function, a group of rules are given. By making use of these rules, graph′s depth first search recursive algorithm and n-order Legendre polynomial recursive algorithm are (converted) to equivalent non-recursive algorithms.
Key concepts: Recursion (computer science), μ operator, Recursive functions, Primitive recursive function, Legendre polynomials, Double recursion, Mathematics, Function (biology)