Run results for: Quick sort vs Merge sort

Test name	Executions per second
✓ Merge Sort	6,316 Ops/sec
Quick Sort	2,024 Ops/sec

Tests:

Quick Sort
function quickSort(arr) { quick_sort(arr, 0, arr.length - 1); return arr; } function quick_sort(arr, low, high) { if (low < high) { // Get the partition index const pi = partition(arr, low, high); // Recursively sort elements before and after partition quick_sort(arr, low, pi - 1); quick_sort(arr, pi + 1, high); } } function partition(arr, low, high) { // Using last element as pivot const pivot = arr[high]; let i = low - 1; // Index of smaller element for (let j = low; j < high; j++) { // If current element is smaller than or equal to pivot if (arr[j] <= pivot) { i++; // Increment index of smaller element // Swap elements [arr[i], arr[j]] = [arr[j], arr[i]]; } } // Place pivot in its correct position [arr[i + 1], arr[high]] = [arr[high], arr[i + 1]]; return i + 1; } 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)