Calculating factorials using recursion : Function Recursive « Function « C / ANSI-C

Home
C / ANSI-C
1.assert.h
2.Console
3.ctype.h
4.Data Structure Algorithm
5.Data Type
6.Development
7.File
8.Function
9.Language Basics
10.Macro Preprocessor
11.Math
12.math.h
13.Memory
14.Pointer
15.setjmp.h
16.signal.h
17.Small Application
18.stdio.h
19.stdlib.h
20.String
21.string.h
22.Structure
23.time.h
24.wctype.h
C / ANSI-C » Function » Function RecursiveScreenshots 
Calculating factorials using recursion


#include <stdio.h>

long factorial(long);

void main()
{
  long number = 0;
  printf("\nEnter an integer value: ");
  scanf(" %ld", &number);
  printf("\nThe factorial of %ld is %ld\n", number, factorial(number));
}

/* recursive factorial function */
long factorial(long N)
{
  ifN < )
    return N;
  else 
    return N*factorial(N - 1);
}



           
       
Related examples in the same category
1.A recursive power functionA recursive power function
2.Prints out Fibonacci numbersPrints out Fibonacci numbers
3.Recursive function call
4.Function: Recursive call
5.Copy string using recursion
6.Recursive function with static variable
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.