Usage scenarios for recursive functions

1. Complete recursion with recursion
Method:
1) The result of placing the focus on the target of the desired solution, i.e. i=n
2) to find the relationship between the nth time and the first n-1;
3) Determine the return result for the 1th time
Example of a cut cake

where n is the number of knives to be cut, Q (n) is the number of pieces of pie
Code implementation

int get_cake_number (int  cutnum) {    if0)    {          return1;    }     Else     {        return1));}    }

2, recursive simulation of the continuous occurrence of the action
Method:
1) Figure out what the continuous action is.
2) Figuring out the relationship between the different actions
3) Figuring out what the boundary conditions are

Example: binary number of an output integer
Code implementation

void CONVERT (int  x) {    if20)    {        CONVERT (x /2);         << x2;    }     Else     {        2;    }}

Usage scenarios for recursive functions