Recursion : Recursive Function « Function « C Tutorial





  1. A recursive function is a function that calls itself.
  2. The speed of a recursive program is slower because of stack overheads.
  3. In recursive function we need to specify recursive conditions, terminating conditions, and recursive expressions.
#include <stdio.h>

int add(int k,int m);

main()
{
    int k ,i,m;
    m=2;
    k=3;
    i=add(k,m);
    printf("The value of addition is %d\n",i);
}

int add(int pk,int pm)
{
    if(pm==0)
       return(pk);
    else
       return(1+add(pk,pm-1));
}
The value of addition is 5










8.8.Recursive Function
8.8.1.Recursion
8.8.2.Calculate factorials using recursion
8.8.3.Recursive fibonacci function