Recursion

Recursion :- Factorial Of Number

#include<conio.h>

#include<stdio.h>

#include<iostream.h>

int fact(int);

void main()

{

clrscr();

int num;

cout<<"Enter any number for finding fact..";

cin>>num;

int f=fact(num);

cout<<"\nFactorial is :-  "<<f;

getch();

}

int fact(int x)

{

 if(x==1)

    return 1;

 else{

   int temp=x*fact(x-1);

   return(temp);

   }

}

Recursion :- Fibonacci Of Number

#include<conio.h>

#include<stdio.h>

#include<iostream.h>

int fib(int);

void main()

{

clrscr();

int num;

cout<<"Enter any number for finding fib..";

cin>>num;

int f=fib(num);

cout<<"\nFibonacci series is :-  "<<f;

getch();

}

int fib(int x)

{

 int temp;

 if(x==0 || x==1){

    return x;

    }

 else{

    temp=fib(x-2)+fib(x-1);

      return temp;

   }

} 

Recursion :- Sum Of Numbers

#include<conio.h>

#include<stdio.h>

#include<iostream.h>

int digit(int);

void main()

{

clrscr();

int n;

cout<<"Enter any Number:-> ";

cin>>n;

int s=digit(n);

cout<<"\nSum is = "<<s;

getch();

}

int digit(int n)

{

 int r;

 if(n<1)

  return n;

  else

  return n+digit(n-1) ;

}