Shared Benchmark

Globals

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

• 0 ops/s

  function bucketSort(arr, bucketSize) { if (arr.length < 2) { return arr; } const buckets = createBuckets(arr, bucketSize); return sortBuckets(buckets); } function createBuckets(arr, bucketSize) { let min = arr[0]; let max = arr[0]; for (let i = 1; i < arr.length; i++) { if (arr[i] < min) { min = arr[i]; } else if (arr[i] > max) { max = arr[i]; } } const bucketCount = Math.floor((max - min) / bucketSize) + 1; const buckets = []; for (let i = 0; i < arr.length; i++) { const bucketIndex = Math.floor((arr[i] - min) / bucketSize); if (!buckets[bucketIndex]) buckets[bucketIndex] = []; buckets[bucketIndex].push(arr[i]); } return buckets; } function sortBuckets(buckets) { const sortedArr = []; for (let i = 0; i < buckets.length; i++) { if (buckets[i] != null) { insertionSort(buckets[i]); sortedArr.push(...buckets[i]); } } return sortedArr; } bucketSort(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);