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

This article mainly shows you "what js recursive function refers to", the content is simple and easy to understand, clear organization, I hope to help you solve doubts, let Xiaobian lead you to study and learn "what js recursive function refers to" this article bar.

In programming languages, if the function Func(Typea,...) directly or indirectly calls the function itself, the function is called a recursive function. Recursive functions cannot be defined as inline functions. Mathematically, a recursive function is defined as follows: For a function f(x) whose domain is the set A, then f(x) is said to be recursive if, for some value X0 in the set A, the function value f(x0) is determined by f(f(x0)).

js recursive function definition

A computational process in which each step uses the results of the previous step or steps is called recursive. Functions defined by recursive procedures are called recursive functions, such as addition, multiplication, and factorial. Every function that recurs is calculable, that is, it can be done.

A classical recursive function is a function defined on a set of natural numbers, and its unknown value is often determined by returning to a known value through a finite number of operations, so it is called "recursion." It is the object of classical recursive function theory.

js recursive function example

In mathematical logic and computer science, a recursive function or μ-recursive function is a class of functions that count from natural numbers to natural numbers and are "computable" in some intuitive sense. In fact, it is proved in computability theory that recursive functions are exactly computable functions of Turing machines. Recursive functions are related to primitive recursive functions, and their inductive definitions (see below) are built on top of primitive recursive functions. However, not all recursive functions are primitive recursive functions-the most famous such function is the Ackermann function.

Other equivalent classes of functions are λ-recursive functions and functions computable by Markov algorithms.

A direct example

//Code 1

voidfunc()

{

//...

if(...)

func();

else

//...

}

conditions

A function that contains statements that call this function directly or indirectly is called a recursive function. As can be seen from the above example, it must satisfy the following two conditions:

1) Every 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 Fanta

//C

voidhanoi(intn,charx,chary,charz)

{

if(n==1)

move(x,1,z);

else

{

hanoi(n-1,x,z,y);

move(x,n,z);

hanoi(n-1,y,x,z);

}

}

The above is "js recursive function refers to what" all the contents of this article, thank you for reading! I believe that everyone has a certain understanding, hope to share the content to help everyone, if you still want to learn more knowledge, welcome to pay attention to the industry information channel!

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.