tail-recursion - Read For Learn

What is tail call optimization?

Tail-call optimization is where you are able to avoid allocating a new stack frame for a function because the calling function will simply return the value that it gets from the called function. The most common use is tail-recursion, where a recursive function written to take advantage of tail-call optimization can use constant stack space. … Read more

What is tail recursion?

Consider a simple function that adds the first N natural numbers. (e.g. sum(5) = 0 + 1 + 2 + 3 + 4 + 5 = 15). Here is a simple JavaScript implementation that uses recursion: If you called recsum(5), this is what the JavaScript interpreter would evaluate: Note how every recursive call has to complete before … Read more

error code: 523