+javascript&jquery. Recursion

Recursive

Recursion (English: recursion), also translated as recursion, in mathematics and computer science, refers to the method of using the function itself in the definition of a function.

Recursive can be judged, the two structure of the loop to play the most thoroughly.

The Fibonacci sequence, also known as the Golden Section, refers to a sequence of numbers: 1, 1, 2, 3, 5, 8, 13, 、...... In mathematics, the Fibonacci sequence is defined as a recursive method: F0=0,f1=1,fn=f (n-1) +f (n-2) (n>=2,n∈n*)

function recursion(n){      if (n == 0)      {          return 0;      }      else if (n == 1)      {          return 1;      } else {          return recursion(n-1)+recursion(n-2);      } }  println(recursion(50));  function println(a) {      document.write(a + ‘<br>‘ ); }

+javascript&jquery. Recursion