Recursive method of calculation

The recursive method uses the method of "step by step" and uses the existing information to deduce new things.

Shun-Push method: Refers to starting from the known conditions, gradually calculate the method to solve the problem

The inverse-push method is to deduce the starting condition of the problem from the known results, and the inverse process of the extrapolation method by means of the iterative representation.

Example 1

#include <stdio.h>

#include NUM 13

int main ()

{

int i;

Long Fib[num] = {#}

for (i=2; i<num; i++)

{

Fib[i] = fib[i-1]+fib[i-2];

}

return 0;

}

Example 2

#define FETCH 1000

#define RATE 0.0171

int main ()

{

Double corpus[49];

int i;

for (i=47; i>0; i--)

{

Corpus[i] = (corpus[i+1]+fetch)/(1+RATE/12);

}

return 0;

}

Recursive method of calculation