Algoritmlar (animatsiya)Brauzeringizda ishlaydiTekshirilgan sana: 1-oktabr, 2026

Merge Sort animatsiyasi

Merge Sort animatsiyasi. Front-end uchun animatsiyali algoritmlar: saralash, qidirish, debounce va throttle, event loop, virtual DOM, kesh, trie va yoʻl topish. Brauzeringizda tez, maxfiy va oson ishlaydi.

Mahalliystandart holatda maxfiyTezroʻyxatdan oʻtish shart emas

Quyidagi tool tugmalari va matnlari hozircha ingliz tilida.

SortingTime: O(n log n)Space: O(n)

Numbers (2 to 30, comma separated)

Step 1 / 55

Merge sort splits the list in half again and again, then merges the sorted halves back together.

comparing
swapped / moved
pivot / minimum
sorted

JavaScript

1function mergeSort(arr) {
2  if (arr.length < 2) return arr;
3  const mid = arr.length >> 1;
4  const left = mergeSort(arr.slice(0, mid));
5  const right = mergeSort(arr.slice(mid));
6  const out = [];
7  while (left.length && right.length) {
8    out.push(left[0] <= right[0] ? left.shift() : right.shift());
9  }
10  return [...out, ...left, ...right];
11}

Tip: use the arrow keys to step and the space bar to play or pause.

Loading animation...