Merge sort VS. Bubble 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 Merge Mastermind and at the bottom it's the The Bubble Buster. Now, let the battle commence!

If you would like to read more about the Merge and Bubble sorting algorithms, you are in luck! We have a blog-post here.

Globals

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

• 0 ops/s

  function mergeSort(arr){ const len = arr.length; if(len < 2) return arr; const mid = Math.floor(len/2); const left = arr.slice(0,mid); const right = arr.slice(mid); return merge(mergeSort(left),mergeSort(right)); } function merge(left, right){ const result = []; const lLen = left.length; const rLen = right.length; let l = 0; let r = 0; while(l < lLen && r < rLen){ if(left[l] < right[r]){ result.push(left[l++]); else result.push(right[r++]); } return result.concat(left.slice(l)).concat(right.slice(r)); } mergeSort(data);
• 0 ops/s

  function bubbleSort(arr) { const len = arr.length; for (let i = len - 1; i >= 0; i--) { for (let j = 1; j <= i; j++) { if (arr[j - 1] > arr[j]) { const temp = arr[j - 1]; arr[j - 1] = arr[j]; arr[j] = temp; } } } return arr; } bubbleSort(data);

---

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

New Benchmark New Notebook