Algoritmos

Algoritmos

• https://www.cs.usfca.edu/~galles/visualization/

• https://github.com/humanwhocodes/computer-science-in-javascript

• https://github.com/mgechev/javascript-algorithms

• https://github.com/trekhleb/javascript-algorithms

Links

• Notação Big O

Arvóres

• Breadth-First Search

• Depth-First Search

• Quadtree

Backtracking

• Combination Sum

• Hamiltonian Cycle

• Jump Game

• Knight's Tour

• N-Queens Problem

• Unique Paths

Buscas

• Binary Search

• Interpolation Search

• Jump Search

• Linear Search

Cadeia de Caracteres

• Hamming Distance

• Knuth–Morris–Pratt Algorithm

• Levenshtein Distance

• Longest Common Substring

• Rabin Karp Algorithm

• Regular Expression Matching

• Z Algorithm

Classificação

• Bubble Sort

• Counting Sort

• Heap Sort

• Insertion Sort

• Merge Sort

• Quicksort

• Radix Sort

• Selection Sort

• Shellsort

Conjuntos

• Combinações

• Maior subsequência crescente

• Mais longa subsequência comum

• Máximo Subarray

• Permutações

• Permutações de Fisher–Yates

• Potência e Conjunto

• Problema da mochila

• Produto cartesiano

• Soma de Combinação

• Supersequência Comum mais curta

Consenso

• Raft Consensus

Criptografia

• Argon2

• Polynomial Hash

• Scrypt

Divide and Conquer

• Binary Search

• Combinations

• Euclidean Algorithm

• Graph Depth-First Search

• Jump Game

• Merge Sort

• Pascal's Triangle

• Permutations

• Quicksort

• Tree Depth-First Search

• Tower of Hanoi

Dynamic Programming

• 0/1 Knapsack Problem

• Bellman-Ford Algorithm

• Fibonacci Number

• Floyd-Warshall Algorithm

• Integer Partition

• Jump Game

• Levenshtein Distance

• Longest Common Subsequence

• Longest Common Substring

• Longest Increasing Subsequence

• Maximum Subarray

• Rain Terraces

• Regular Expression Matching

• Shortest Common Supersequence

• Unique Paths

Escalonamento

• Round Robin

Força bruta

• Linear Search

• Maximum Subarray

• Rain Terraces

• Travelling Salesman Problem

Gráficos

• Articulation Points

• Bellman-Ford Algorithm

• Breadth-First Search

• Bridges

• Depth-First Search

• Detect Cycle

• Dijkstra Algorithm

• Eulerian Path and Eulerian Circuit

• Floyd-Warshall Algorithm

• Hamiltonian Cycle

• Kruskal’s Algorithm

• Prim’s Algorithm

• Strongly Connected Components

• Topological Sorting

• Travelling Salesman Problem

Greedy

• Dijkstra Algorithm

• Jump Game

• Kruskal’s Algorithm

• Prim’s Algorithm

• Unbound Knapsack Problem

Matemática

• Algoritmo Euclidiano

• Algoritmo Liu Hui π

• Fatorial

• Manipulação Bit

• Mínimo múltiplo comum

• Número complexo

• Número de Fibonacci

• Partição inteira

• Peneira de Eratóstenes

• Potência de dois

• Teste de Primalidade

• Triângulo de Pascal

Pathfinding

• Polyana

Sem categoria

• Flood Fill

• Forward Decay

• HDR Histogram

• Jump Game

• Knight's Tour

• N-Queens Problem

• Rain Terraces

• Square Matrix Rotation

• T-Digest

• Tower of Hanoi

• Unique Paths