Sunday, September 19, 2010

note 002

One of the classic examples of using recursion is calculating a factorial of a number. Here's a typical implementation of this function:


int factorial (int num)
{
if (num==1)
return 1;
return factorial(num-1)*num; // recursive call
}

factorial() calls itself recursively, subtracting 1 from num on each call, until it equals 1. As always, you can use iteration instead of recursion:


int factorial (int num)
{
int result=1;
for (int i=1; i<=num; ++i)
result=result*=i;
return result;
}
Posted by at

9 comments:

  1. kenchoiwindSeptember 19, 2010 at 8:33 PM

    what is next
    next coding is find the pibonichi. rabbit

    ReplyDelete
  2. kenchoiwindSeptember 22, 2010 at 4:49 AM

    one of the classinc examples of using
    recursion is calculating a factorial of
    a number


    Here's typical implementation of this function.

    int factorial(int num)
    {
    if(num==1)
    return 1.
    return factorial(num-1)*num//recurisive call
    }

    ReplyDelete
  3. kenchoiwindSeptember 22, 2010 at 4:50 AM

    int factorial(int num)
    {
    if(num ==1)
    return 1;
    return factorial(num-1)*num//recursive call
    }

    ReplyDelete
  4. kenchoiwindSeptember 22, 2010 at 4:52 AM

    int factorial(int num)
    {
    if(num==1)
    return 1;
    return factorial(num-1)*num//recursive call
    }

    ReplyDelete
  5. kenchoiwindSeptember 22, 2010 at 4:53 AM

    int factorial (int num)
    {
    if(num==1)
    return 1;
    return factorial(num-1)*num//recurisive call
    }

    ReplyDelete
  6. kenchoiwindSeptember 22, 2010 at 4:53 AM

    actorial() calls itself recursively, subtracting 1 from num on each call, until it equals 1. As always, you can use iteration instead of recursion:


    int factorial (int num)
    {
    int result=1;
    for (int i=1; i<=num; ++i)
    result=result*=i;
    return result;
    }

    ReplyDelete
  7. kenchoiwindSeptember 22, 2010 at 4:55 AM

    factorial() call itself recursively, subtracting 1 from num on each call, until it equals 1.
    As always,you can use iteration instead or recursion.
    int factorial(int num)
    { int result = 1;
    for (int i =1; i<=num;++i)
    return result;
    }

    ReplyDelete
  8. kenchoiwindSeptember 22, 2010 at 4:57 AM

    factorial()call itself recursively, subtracting 1,from num on each call, until it equals 1.
    As always you can use iteration instead or recursion
    int factorial(int num)
    {int result = 1;
    for (int i =1; i<=num; ++ 1)
    return result;
    }

    ReplyDelete
  9. kenchoiwindSeptember 22, 2010 at 4:58 AM

    factorial() call itself recursively, subtracting 1.from nm on each call, until it equal 1
    As always you can use iteration instead or recursion
    int factorial(int num)
    {int result = 1;
    for (int i = 1; i<=num; ++1)
    return result;
    }

    ReplyDelete

Subscribe to: Post Comments (Atom)