There are several implementations of recursion compared:
- classic recursive implementation,
- recursive with tail call optimization,
- recursive with memoization,
- classic loop (as "placebo control").
The sum of arithmetical progression 0, 1, 2,... was chosen as a Guinea pig. Following parameters were taken into accounting:
- processor time (
cpuUsercorresponds to running time in microseconds), - memory usage (see NodeJS documentation for detailed info).
No package.json, no dependencies needed.
Run node test.js to check if sum...() implementations are correct.
Run node index.js to fetch the runtime data. They are printed as CSV. Results fetched on my machine reside in ./results.
Pretty similar calculations (sum → factorial) have been performed for browser on JSPerf platform.
Visit https://melnyk.site/post/16 for detailed analysis.