Recursion

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));

}