jsPerf.app is an online JavaScript performance benchmark test runner & jsperf.com mirror. It is a complete rewrite in homage to the once excellent jsperf.com now with hopefully a more modern & maintainable codebase.
jsperf.com URLs are mirrored at the same path, e.g:
https://jsperf.com/negative-modulo/2
Can be accessed at:
https://jsperf.app/negative-modulo/2
Comparing native, bubble, insertion, selection, merge, adaptive merge, and quick sort algorithms on a random array.
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/common.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/bubble-sort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/insertion-sort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/merge-sort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/adaptive-sort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/quickmiddle-sort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/selection-sort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/flashsort.js"></script>
<script src="https://rawgithub.com/escherba/algorithms-in-javascript/master/src/heap-sort.js"></script>
<script src="https://gist.githack.com/anonymous/2ecfead8cf3023258c02/raw/a84a84c784c8ddb25c68bed23d3c5fccc72d9627/DualPivotQuicksort.js"></script>
// Generate array with random integers.
var testArrayLength = 5000;
var unsortedTestArray = new Array(testArrayLength);
for (var i = 0; i < testArrayLength; i++) {
unsortedTestArray[i] = Math.floor(Math.random() * testArrayLength);
}
var sortedTestArray = unsortedTestArray.clone().sort(function compareNumbers(a, b) {
return a - b;
});
function sortLowToHigh(a, b) {
return a - b;
}
function shellSort(a) {
"use strict";
for (var h = a.length; h !== 0 ;h = Math.floor(h / 2)) {
for (var i = h; i < a.length; i++) {
var k = a[i];
for (var j = i; j >= h && k < a[j - h]; j -= h) {
a[j] = a[j - h];
}
a[j] = k;
}
}
return a;
}
function radixInsert(arr, i, j) {
tmp = arr[i];
arr.splice(i, 1);
arr.splice(j, 0, tmp);
}
function radixSort(arr) {
var bit, end, i, mask;
bit = 0;
while (true) {
mask = 1 << bit;
i = 0;
end = arr.length;
while (i < end) {
if (arr[i] & mask) {
radixInsert(arr, i, arr.length - 1);
end--;
} else {
i++;
}
}
bit++;
if (end === arr.length) {
break;
}
}
}
if (!result.compare(sortedTestArray)) {
throw new Error("Array was not sorted");
}
Ready to run.
Test | Ops/sec | |
---|---|---|
Native |
| ready |
InsertionSort |
| ready |
Heapsort |
| ready |
AdaptiveSort |
| ready |
MergeSort |
| ready |
QuickSort |
| ready |
Flashsort |
| ready |
Shellsort |
| ready |
Dual Pivot QuickSort |
| ready |
LSB Radix Sort |
| ready |
You can edit these tests or add more tests to this page by appending /edit to the URL.