Heap sort VS. Insertion sort

Witness the clash of coding titans in the Sorting Algorithm Showdown. Experience the thrill as different methods vie for data dominance. Discover the art and science behind sorting algorithms. Uncover the secrets to optimizing your code for efficient data organization.

On the top we have The Heap Hero and at the bottom it's the The Insertion Dynamo. Now, let the battle commence!

Globals

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

• 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);
• 0 ops/s

  function insertionSort(arr) { const n = arr.length; for (let i = 1; i < n; i++) { const current = arr[i]; let j = i - 1; while (j > -1 && current < arr[j]) { arr[j + 1] = arr[j]; j--; } arr[j + 1] = current; } return arr; } insertionSort(data);

---

Shorts Notebook Demo Blog Donate Wall of love 😻 Popular Telegram Uptime Mastodon

New Benchmark New Notebook