Algoritmler (animasiýa)Brauzeriňizde işleýärBarlanan sene: 1 oktýabr 2026

Quick Sort: animasiýa

Quick Sort: animasiýa. Frontend üçin animasiýaly algoritmler: tertipleme, gözleg, debounce we throttle, event loop, wirtual DOM, keş, trie we ýol gözlegi. Brauzeriňizde çalt, gizlin we ýönekeý.

Ýerliadaty ýagdaýda gizlinÇaltagza bolmak gerek däl

Aşakdaky guralyň düwmeleri we tekstleri heniz iňlis dilinde.

SortingTime: O(n log n) on average, O(n²) worst caseSpace: O(log n)

Numbers (2 to 30, comma separated)

Step 1 / 56

Quick sort picks a pivot, moves smaller values to its left and larger ones to its right, then repeats on both sides.

comparing
swapped / moved
pivot / minimum
sorted

JavaScript

1function quickSort(arr, lo = 0, hi = arr.length - 1) {
2  if (lo >= hi) return;
3  const pivot = arr[hi];
4  let i = lo;
5  for (let j = lo; j < hi; j++) {
6    if (arr[j] < pivot) {
7      [arr[i], arr[j]] = [arr[j], arr[i]];
8      i++;
9    }
10  }
11  [arr[i], arr[hi]] = [arr[hi], arr[i]];
12  quickSort(arr, lo, i - 1);
13  quickSort(arr, i + 1, hi);
14}

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

Loading animation...