C++ Programming Tutorial

 
 
 
 

Program to coumputes and displays the factorial of the given number ( using Recursive Algorithm )

 

Image

 #include <iostream.h>
 #include    <conio.h>

  const long factorial(const long);


 int main( )
 {
    clrscr( );

    int n;

    cout<<\"\\n Enter the number = \";
    cin>>n;

    cout<<\"\\n n! = \"<<n<<\"!\"<<\"  =  \"<<factorial(n)<<endl;

    getch( );
    return 0;
 }



 //--------------------------  factorial( )  -----------------------------//


 const long factorial(const long n)
 {
    long fn=1;

    if(n>1)
       fn=(n*factorial(n-1));

    return fn;
 }

    Related Post:
  1. Program to illustrate an example of Polymorphism ( Pure Virtual functions ).
  2. Program that reads a numbers , computes and displays the factorial of the given number using recursion
  3. Program of polyline translation.
  4. Program of scaling about origin
  5. Program for Operator Overloading and Friend Function concept
  6. Program that takes input of counter and displays output of incremented counter using overloading operator++
  7. Program of Rotate About Origin
  8. Program to illusrate data conversion b/w built-in data types and user defined data types(in char)
  9. Program to read a Non-Linear equation in one variable, then evaluate it using Simple Itrative Method and display its kD accurate root
  10. Program to add two numbers
  11. Program of class to basic conversion
  12. Program to read a Linear System of Equations,then evaluate it by using Gauss-Elimination Method and show the result
  13. Program that provides an example of functions with default arguments
  14. Program that find the distance between two points in 2D and 3D space using function overloading
  15. Program to coumputes and displays the factorial of the given number ( using Recursive Algorithm )
  16. Program to implement the Binary search Algorithm
  17. Program to illustrate the use of friend classes
  18. Program to illustrate the implementation of Rotation Transformation
  19. Program of Boundary Fill (8 Connected Point).
  20. Program of traversing a binary tree in inorder iteratively