Recursion : Recursive Function « Function « C Tutorial

Home
C Tutorial
1.Language
2.Data Type
3.String
4.printf scanf
5.Operator
6.Statement
7.Array
8.Function
9.Structure
10.Pointer
11.Memory
12.Preprocessor
13.File
14.Data Structure
15.Search Sort
16.Wide Character String
17.assert.h
18.ctype.h
19.math.h
20.setjmp.h
21.signal.h
22.stdio.h
23.stdlib.h
24.string.h
25.time.h
26.wctype.h
C Tutorial » Function » Recursive Function 
8.8.1.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));
}
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
java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.