Run results for: Sorting test

Run details:

User agent: Mozilla/5.0 (iPhone; CPU iPhone OS 18_1 like Mac OS X) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/18.1 Mobile/15E148 Safari/604.1

Browser: Mobile Safari 18

Operating system: iOS 18.1

Device Platform: Mobile

Date tested: one year ago

Benchmark engine: Benchmark.js

Test name	Executions per second
✓ custom sort	1,381,458 Ops/sec
normal sort	1,164,016 Ops/sec

Tests:

custom sort
const array1 = [1, 3, 9]; const array2 = [2, 9, 4]; let array = mergeSort(array1, array2); console.log(array); function mergeSort(array1, array2) { //comparing two popular merging techniques spread is slightly faster so that's being used //merge arrays let mergedArray = [...array1, ...array2]; //sort arrays // loop through array for (let i = 0; i < mergedArray.length - 1; i++) { //set first index let min = i; //loop through array again for (let j = i + 1; j < mergedArray.length; j++) { //check if number in first array is smaller if reset index if (mergedArray[j] < mergedArray[min]) { min = j; } } //if index of first for has been reset above it's diffirent which means we can add it to end of the array if (min != i) { let target = mergedArray[i]; mergedArray[i] = mergedArray[min]; mergedArray[min] = target; } } return mergedArray; //return mergedArray.sort((a,b) => a-b); }
normal sort
const array1 = [1, 3, 9]; const array2 = [2, 9, 4]; let array = mergeSort(array1, array2); console.log(array); function mergeSort(array1, array2) { //comparing two popular merging techniques spread is slightly faster so that's being used //merge arrays let mergedArray = [...array1, ...array2]; //sort arrays return mergedArray.sort((a,b) => a-b); }