Run results for: Quick Sort 2 vs Merge Sort

Run details:

User agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/124.0.0.0 Safari/537.36

Browser: Chrome 124

Operating system: Linux

Device Platform: Desktop

Date tested: one year ago

Test name	Executions per second
Quick Sort	56294.4 Ops/sec
Merge Sort	4548.6 Ops/sec

HTML Preparation code:

<!--your preparation HTML code goes here-->

Script Preparation code:

var arr = new Array(1000);
for (let i = 0; i < size; i++) {
    arr[i] = Math.floor(Math.random() * 1000000); // Random numbers between 0 and 999999
}

Tests:

Quick Sort
function quickSort(arr) { if (arr.length <= 1) return arr; const pivot = arr[Math.floor(arr.length / 2)]; const left = []; const right = []; const equal = []; for (let element of arr) { if (element < pivot) { left.push(element); } else if (element > pivot) { right.push(element); } else { equal.push(element); } } return [...quickSort(left), ...equal, ...quickSort(right)]; } quickSort(arr)
Merge Sort
function mergeSort(arr) { if (arr.length <= 1) return arr; const mid = Math.floor(arr.length / 2); const left = arr.slice(0, mid); const right = arr.slice(mid); return merge(mergeSort(left), mergeSort(right)); } function merge(left, right) { const result = []; let leftIndex = 0; let rightIndex = 0; while (leftIndex < left.length && rightIndex < right.length) { if (left[leftIndex] < right[rightIndex]) { result.push(left[leftIndex]); leftIndex++; } else { result.push(right[rightIndex]); rightIndex++; } } return result.concat(left.slice(leftIndex)).concat(right.slice(rightIndex)); } mergeSort(arr)