Difference between recursion and iteration - JavaScript

Hi,

Can you please provide me a simple example on:

Difference between recursion and iteration - JavaScript

Thanks
milani_lucieAsked:
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

x
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Gurvinder Pal SinghCommented:
leakim971PluritechnicianCommented:
Test page (recursion) : http://jsfiddle.net/Mjzkk/
function factorial_recursion(n) {
      if(n!=1) n * factorial_recursion;
}

Open in new window


test page (iteration) : http://jsfiddle.net/Kvmrc/
function factorial_iteration(n) {
    a = n;
    while(n!=1) {
        n = n -1;
        a *= n;
    }
    return a;
}

Open in new window


http://en.wikipedia.org/wiki/Factorial

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
leakim971PluritechnicianCommented:
correction (recursion) :
function factorial_recursion(n) {
    if(n!=1) n = n * factorial_recursion(n-1);
    return n;
}

Open in new window

Big Business Goals? Which KPIs Will Help You

The most successful MSPs rely on metrics – known as key performance indicators (KPIs) – for making informed decisions that help their businesses thrive, rather than just survive. This eBook provides an overview of the most important KPIs used by top MSPs.

leakim971PluritechnicianCommented:
to be mathematicaly correct (and not just for the example) : 0! = 1
so :

function factorial_recursion(n) {
      if(n==0) return 1;
      if(n!=1) n * factorial_recursion(n-1);
      return n;
}

Open in new window

and :
function factorial_iteration(n) {
    if(n==0) return 1;
    a = n;
    while(n!=1) {
        n = n -1;
        a *= n;
    }
    return a;
}

Open in new window

Kiran SonawaneProject LeadCommented:
Recursion repeatedly invokes the mechanism itself as explained by @leakim971 using factorial number. Both iteration and recursion are based on a control structure. Iteration explicitly uses a repetition structure; recursion achieves repetition through repeated method calls.

Keep in Mind:

Recursion consequently the overhead of method calls. This can be expensive in both processor time and memory space.
user_nCommented:
Recursion invokes the function itself. If you do not stop the process right it might proceed forever. It takes more space in the stack of the computer (http://en.wikipedia.org/wiki/Call_stack), because of witch it usually takes more time and memory.But in some cases it is the easiest way of finding of programing solution to a problem. Some more info (http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/)
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
JavaScript

From novice to tech pro — start learning today.