sort-algorithms (v51)

Revision 51 of this benchmark created on

Description

Comparing native, bubble, insertion, selection, merge, adaptive merge, and quick sort algorithms on a random array.

Preparation HTML

<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>

Setup

// Generate array with random integers.
    var testArrayLength = 5000;
    var sourceArray = new Array(testArrayLength);
    for (var i = 0; i < testArrayLength; i++) {
      sourceArray[i] = Math.floor(Math.random() * testArrayLength);
    }
    var sortedTestArray = sourceArray.clone().sort(function(a, b) {
      return a - b;
    });
    var unsorted = sourceArray.clone();
    
    function shellSort(a) {
      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;
    }

Teardown


    for (var i = 0; i < testArrayLength; i++) {
      unsorted[i] = Math.floor(Math.random() * testArrayLength);
    }

Test runner

Ready to run.

Testing in
TestOps/sec
Native
var result = unsorted.sort();
ready
InsertionSort
var result = aij.insertionSort(unsorted);
ready
Heapsort
var result = aij.heapSort(unsorted);
ready
AdaptiveSort
var result = aij.adaptiveSort(unsorted);
ready
MergeSort
var result = aij.mergeSort(unsorted);
ready
QuickSort
var result = aij.quickmiddleSort(unsorted);
ready
Flashsort
var result = aij.flashSort(unsorted);
ready
Shellsort
var result = shellSort(unsorted);
ready
Native Sorted
var result = sortedTestArray.sort();
ready
InsertionSort Sorted
var result = aij.insertionSort(sortedTestArray);
ready
HeapSort Sorted
var result = aij.heapSort(sortedTestArray);
ready
AdaptiveSort Sorted
var result = aij.adaptiveSort(sortedTestArray);
ready
MergeSort Sorted
var result = aij.mergeSort(sortedTestArray);
ready
QuickSort Sorted
var result = aij.quickmiddleSort(sortedTestArray);
ready
FlashSort Sorted
var result = aij.flashSort(sortedTestArray);
ready
ShellSort Sorted
var result = shellSort(sortedTestArray);
ready

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.