http://cse.unl.edu/~dsadofs/RecursionTutorial/index.php?s=algorithms#recfactalg

Well, as stated in the description of a recursive definition, a base case and inductive rule were needed. In this case, fact(0)=1 is the base case. This is a logical place to start, seeing as how the n in fact(n) must be larger than or equal to 1 (only positive integers). The other half is the inductive rule of the problem, which in this case is represented by “fact(n)=fact(n-1)*n”. We can see the logic in this, as the factorial of any number, is simply the factorial of the number one smaller than it, times the number you’re finding the factorial of.

In this tutorial , it is said that a recursive function divide to the two part, Base and inductive

Now, look at this function:

In this function, If n>0 is base, and rem=n%10;

s += rem;

sum(n/10)

Is inductive?

Is it right that said every recursive function divide to the two parts?