Created
January 4, 2018 08:29
-
-
Save Jeff-Mott-OR/b6e8fcab6e40711b9bb58b251c800147 to your computer and use it in GitHub Desktop.
Recursion Vs Loop (http://jsbench.github.io/#b6e8fcab6e40711b9bb58b251c800147) #jsbench #jsperf
This file contains 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
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="utf-8"/> | |
<title>Recursion Vs Loop</title> | |
<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script> | |
<script src="./suite.js"></script> | |
</head> | |
<body> | |
<h1>Open the console to view the results</h1> | |
<h2><code>cmd + alt + j</code> or <code>ctrl + alt + j</code></h2> | |
</body> | |
</html> |
This file contains 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
"use strict"; | |
(function (factory) { | |
if (typeof Benchmark !== "undefined") { | |
factory(Benchmark); | |
} else { | |
factory(require("benchmark")); | |
} | |
})(function (Benchmark) { | |
var suite = new Benchmark.Suite; | |
Benchmark.prototype.setup = function () { | |
function powUsingLoop(x, n) { | |
var result = 1; | |
for (var i = 0; i < n; i++) { | |
result *= x; | |
} | |
return result; | |
} | |
function powUsingRecursion(x, n) { | |
if (n == 1) { | |
return x; | |
} else { | |
return x * powUsingRecursion(x, n - 1); | |
} | |
} | |
}; | |
suite.add("powUsingLoop(2,3)", function () { | |
powUsingLoop(2,3) | |
}); | |
suite.add("powUsingRecursion(2,3)", function () { | |
powUsingRecursion(2,3) | |
}); | |
suite.on("cycle", function (evt) { | |
console.log(" - " + evt.target); | |
}); | |
suite.on("complete", function (evt) { | |
console.log(new Array(30).join("-")); | |
var results = evt.currentTarget.sort(function (a, b) { | |
return b.hz - a.hz; | |
}); | |
results.forEach(function (item) { | |
console.log((idx + 1) + ". " + item); | |
}); | |
}); | |
console.log("Recursion Vs Loop"); | |
console.log(new Array(30).join("-")); | |
suite.run(); | |
}); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment