Shulou(Shulou.com)06/03 Report--

This article mainly introduces the meaning of js recursive function, has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, the following let Xiaobian take you to understand it.

In the programming language, the function Func (Typea,...) If the function itself is called directly or indirectly, the function is called a recursive function. Recursive functions cannot be defined as inline functions. Mathematically, the definition of a recursive function is as follows: for a function f (x), its definition domain is set A, then if for a value X0 in A set, its function value f (x0) is determined by f (f (x0)), then f (x) is called a recursive function.

Recursive function definition

A computational process in which each step uses the results of the previous step or previous steps, which is called recursive. Functions defined by recursive processes are called recursive functions, such as continuous addition, continuous multiplication, factorial, and so on. All recursive functions are computable, that is, feasible [1].

Classical recursive function is a kind of function defined on the set of natural numbers, and its unknown value is often obtained by returning to the known value through finite operations, so it is called "recursion". It is the research object of classical recursive function theory [1].

Introduction to Recursive function

In mathematical logic and computer science, recursive function or μ-recursive function is a kind of function from natural number to natural number, which is "calculable" in some intuitive sense. In fact, in the theory of computability, it is proved that the recursive function is exactly the computable function of Turing machine. Recursive functions are about the original recursive functions, and their inductive definitions (see below) are built on top of the original recursive functions. However, not all recursive functions are primitive recursive functions-the most famous of which is the Ackerman function.

Other equivalent function classes are λ-recursive functions and functions that can be calculated by Markov algorithm.

A direct example.

/ / Code 1

Voidfunc ()

{

/ /...

If (...)

Func ()

Else

/ /...

}

Conditions

A function that calls this function statement directly or indirectly is called a recursive function, and as you can see in the above example, it must meet the following two conditions:

1) each time you call yourself, it must be (in a sense) closer to the solution

2) there must be a criterion for terminating processing or calculation.

For example:

Recursive function of Van Pagoda

/ / C

Voidhanoi (intn,charx,chary,charz)

{

If (nasty 1)

Move (XBI 1JZ)

Else

{

Hanoi (nmer1, x, 2, 4, 4, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,

Move (XMagol nMagol z)

Hanoi (nmur1, y, and x, Z)

}

}

Thank you for reading this article carefully. I hope the article "what is the meaning of js recursive function" shared by the editor will be helpful to everyone? at the same time, I also hope that you will support us and pay attention to the industry information channel. More related knowledge is waiting for you to learn!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.