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

Memoization animatsiyasi

Memoization 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.

Graphs and textTime: O(n) instead of O(2ⁿ) for FibonacciSpace: O(n)

fib(n)Memoization

fib(5)

Function calls

Memo cache

empty

Step 1 / 20

Recursive fib recomputes the same values again and again. Memoization stores each result so it is calculated once.

JavaScript

1function fib(n, memo = {}) {
2  if (n < 2) return n;
3  if (memo[n] !== undefined) return memo[n];
4  memo[n] = fib(n - 1, memo) + fib(n - 2, memo);
5  return memo[n];
6}

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

Loading animation...