Test case details

Preparation Code

<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>
// Generate array with 10,000 random integers.     testArrayLength = 10000;     var unsortedTestArray = new Array(testArrayLength);     for (var i = 0; i < testArrayLength; i++) {       unsortedTestArray[i] = Math.floor(Math.random()*100000);     }     var sortedTestArray = unsortedTestArray.clone().sort(function compareNumbers(a, b) {       return a - b;     });
    if (!unsortedTestArray.compare(sortedTestArray)) {        throw new Error("Array was not sorted");     }

Test cases

Test #1

unsortedTestArray.sort(function compareNumbers(a, b) {   return a - b; });

Test #2

aij.insertionSort(unsortedTestArray);

Test #3

aij.heapSort(unsortedTestArray);

Test #4

unsortedTestArray = aij.adaptiveSort(unsortedTestArray);

Test #5

unsortedTestArray = aij.mergeSort(unsortedTestArray);

Test #6

aij.quickmiddleSort(unsortedTestArray);

Test #7

aij.flashSort(unsortedTestArray);