The Algorithms logo
The Algorithms
Acerca deDonar
Retroceso
Cifradores
Estructuras de datos
Dividir y conquistar
Programación dinámica

Longest Continuous Increasing Subsequence

Longest Common Subsequence

Longest Increasing Subsequence

General

Huffman Encoding

Geometría

Closest Points

Gráficas

Prufer Code

Minimum Spanning Tree

Graph Enumeration

Breadth First Search

Depth First Search

Bellman Ford

Dinic Maxflow

Centroid Decomposition

Depth First Search Tic Tac Toe

Strongly Connected Components

Disjoint Set Union

Dijkstra

Hashing
Matemáticas

Extended Euclidean Algorithm

Baby Step Giant Step

Pascal Triangle

Square Root

Sieve of Eratosthenes

Prime Check

Perfect Numbers

Linear Sieve

Prime Factors

Miller Rabin

Trial Division

Zellers Congruence Algorithm

Karatsuba Multiplication

Greatest Common Divisor

Simpson Integration

Pollard Rho

Armstrong Number

Gcd of N Numbers

Quadratic Residue

Lcm of N Numbers

Fibonacci Numbers

Análisis numérico

Gaussian Elimination

Métodos numéricos

Fast Fourier Transform

Consultas de rango

Heavy Light Decomposition

Búsquedas

Union Find

Ternary Search Min Max

Ternary Search

Interpolation Search

Ternary Search Min Max Recursive

Jump Search

Fibonacci Search

Exponential Search

Kth Smallest

Kth Smallest Heap

Binary Search Recursive

Binary Search

+12

Más

Linear Search

+11

Más

Quick Select

Ternary Search Recursive

Ordenamiento

Topological Sort

Exchange Sort

Bucket Sort

Comb Sort

Insertion Sort

+16

Más

Bubble Sort

+17

Más

Radix Sort

Bogo Sort

Cycle Sort

Counting Sort

Cocktail Shaker Sort

Pancake Sort

Stooge Sort

Heap Sort

+13

Más

Gnome Sort

Shell Sort

Selection Sort

+13

Más

Odd Even Sort

Quick Sort

+17

Más
Cadenas

Z Algorithm

Rabin Karp

Knuth Morris Pratt

Manacher

Aho Corasick

Burrows Wheeler Transform

Hamming Distance