Benchmark: fibonacci Recursive vs Memoization

Tests:

Recursive
function fibonacciRecursive(num) { if (num === 0) return 0; else if (num === 1) return 1; else return fibonacciRecursive(num - 1) + fibonacciRecursive(num - 2); //i[n] = i[n-1] + i[n-2] } fibonacciRecursive(10)
Memoization
function fibonacciRecursiveObjDefault(num, cache = {}) { //base case as normal if (num === 0) return 0; else if (num === 1) return 1; if (cache[num]) return cache[num]; //retrieve cached data if exists let output = fibonacciRecursiveObjDefault(num - 1, cache) + fibonacciRecursiveObjDefault(num - 2, cache); //recursive call as normal cache[num] = output; //store output into the cache for future use return output; } fibonacciRecursiveObjDefault(10)

Rendered benchmark preparation results:

Previous results

Test case name	Result
Recursive
Memoization

ⓘ Get performance results from real users on your website with Request Metrics.

Latest run results:

Run details: (Test run date: one year ago)

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:109.0) Gecko/20100101 Firefox/110.0

Browser/OS: Firefox 110 on Mac OS X 10.15

Test name	Executions per second
Recursive	880343.4 Ops/sec
Memoization	3959601.0 Ops/sec

fibonacci Recursive vs Memoization (version: 0)