Shared Benchmark

Globals

• const data = [ ...new Array(3500) ].map(Math.random)

• 0 ops/s

  function bogoSort(items) { while (!isSorted(items)) shuffle(items); return items; } function isSorted(arr) { const length = arr.length; for (let i = 0; i < length - 1; i++) { if (arr[i] > arr[i + 1]) return false; } return true; } function shuffle(arr) { for (let i = arr.length - 1; i; i--) { const m = Math.floor(Math.random() * i); const n = arr[i - 1]; arr[i - 1] = arr[m]; arr[m] = n; } } bogoSort(data)
• 0 ops/s

  function heapSort(arr) { const len = arr.length; let end = len - 1; heapify(arr, len); while (end > 0) { swap(arr, end--, 0); siftDown(arr, 0, end); } return arr; } function heapify(arr, len) { let mid = Math.floor((len - 2) / 2); while (mid >= 0) { siftDown(arr, mid--, len - 1); } } function siftDown(arr, start, end) { let root = start; let child = root * 2 + 1; let toSwap = root; while (child <= end) { if (arr[toSwap] < arr[child]) { swap(arr, toSwap, child); } if (child + 1 <= end && arr[toSwap] < arr[child + 1]) { swap(arr, toSwap, child + 1); } if (toSwap != root) { swap(arr, root, toSwap); root = toSwap; } else { return; } toSwap = root; child = root * 2 + 1; } } function swap(arr, i, j) { const temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } heapSort(data);