Asosiy tarkibga o‘tish

Algoritmlar vizualizatori

//

—/—

0.75×

Algoritmlar

/

Asosiy tushunchalar

8

Big O Notation8 Recursion8 Two Pointers8 Sliding Window8 Prefix Sum Array8 Space Complexity8 Memoization8 Greedy vs DP8

Ma'lumotlar tuzilmalari

8

Stack8 Queue8 Linked List8 Hash Table8 Binary Search Tree8 Heap8 Trie8 LRU Cache8

10

Bubble Sort10 Selection Sort10 Insertion Sort10 Quick Sort10 Merge Sort10 Heap Sort10 Counting Sort10 Radix Sort10 Shell Sort10 Bucket Sort10

4

Binary Search4 Linear Search4 Jump Search4 Interpolation Search4

5

Breadth-First Search5 Depth-First Search5 Dijkstra's Algorithm5 Prim's Algorithm5 Topological Sort5

Dinamik dasturlash

3

Fibonacci DP3 Knapsack 0/13 Longest Common Subsequence3

Qaytish orqali qidirish

3

N-Queens Problem3 Sudoku Solver3 Maze Pathfinding3

Bo‘lib tashla va hukmronlik qil

2

Tower of Hanoi2 Binary Exponentiation2

2

Euclidean Algorithm2 Sieve of Eratosthenes2

6

Run-Length Encoding6 LZ776 LZW6 Huffman Coding6 DEFLATE6 Brotli6

51 ta algoritm·by midudev

Bosh sahifa
/
Graflar

Graflar

Graflar bo'ylab yurish va graf algoritmlari: BFS, DFS, eng qisqa yo'llar, minimal tayanch daraxt (MST) va topologik saralash.

5 ta algoritm

Breadth-First SearchO'rtacha
Depth-First SearchO'rtacha
Dijkstra's AlgorithmMurakkab
Prim's AlgorithmMurakkab
Topological SortMurakkab

Kod

Kod yuklanmoqda…

Console(0)

O'zgaruvchilar

Kodini ko'rish uchun algoritmni tanlang