Created
March 5, 2013 01:40
-
-
Save InPermutation/5087328 to your computer and use it in GitHub Desktop.
An example of tail recursion that is not optimized by Node.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var r = recurse(process.argv[2] || 5000, 0); | |
| console.log('found', r); | |
| function recurse(n, j) { | |
| if(n>0) return recurse(n-1, j+1); | |
| else return j; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment