Insertion sort VS. Quick 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 Insertion Dynamo and at the bottom it's the The Quickfire Ninja. Now, let the battle commence!

Globals

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

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

  function quickSort(arr, left, right) { const len = arr.length; let pivot; let partitionIndex; if (left < right) { pivot = right; partitionIndex = partition(arr, pivot, left, right); quickSort(arr, left, partitionIndex - 1); quickSort(arr, partitionIndex + 1, right); } return arr; } function partition(arr, pivot, left, right) { const pivotValue = arr[pivot]; let partitionIndex = left; for (var i = left; i < right; i++) { if (arr[i] < pivotValue) { swap(arr, i, partitionIndex); partitionIndex++; } } swap(arr, right, partitionIndex); return partitionIndex; } function swap(arr, i, j) { const temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } quickSort(data);

---

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

New Benchmark New Notebook