The Algorithms logo
The Algorithms
Acerca deDonar
undefined

Knapsack

Retroceso

Subset Sum

N Queens All Solution Optimised

Knight Tour

Subarray Sum

Sudoku Solve

Nqueen Print All Solutions

Magic Sequence

Wildcard Matching

Graph Coloring

Manipulación de bits

Count of Trailing Ciphers in Factorial N

Count of Set Bits

Cadena de bloques

Modular Division

Cifras

Elliptic Curve Key Exchange

Xor Cipher

Uint 128 T

Caesar Cipher

A 1z 26 Cipher

Morse Code

Base 64 Encoding

Hill Cipher

Uint 256 T

Atbash Cipher

Vigenere Cipher

Compresión
Conversiones

Decimal to Hexadecimal

Decimal to Binary

Algoritmos de programación de CPU
Estructuras de datos

Trie Using Hashmap

Linkedlist Implentation Usingarray

Binary Search Tree 2

Queue Using Linked List

Stack Using Array

Queue Using Array

Circular Queue Using Linked List

Queue Using Array 2

Queue Using Linked List

Stack Using Linked List

Stack Using Queue

Dsu Path Compression

Reverse a Linked List

Queue Using Two Stacks

Dividir y conquistar

Karatsuba Algorithm for Fast Multiplication

Programación dinámica

Searching of Element in Dynamic Array

Coin Change Topdown

Matrix Chain Multiplication

Longest Increasing Subsequence (Nlogn)

Egg Dropping Puzzle

Palindrome Partitioning

Fibonacci Bottom Up

Longest Palindromic Subsequence

Longest Increasing Subsequence

Minimum Edit Distance

Longest Common Subsequence

Longest Common String

Geometría

Jarvis Algorithm

Graham Scan Functions

Graham Scan Algorithm

Line Segment Intersection

Gráficos

Spirograph

Gráficas

Dijkstra

Bellman Ford

Dijkstra

Topological Sort by Kahns Algo

Max Flow with Ford Fulkerson and Edmond Karp Algo

Bridge Finding with Tarjan Algorithm

Depth First Search with Stack

Is Graph Bipartite

Hamiltons Cycle

Connected Components

Depth First Search

Cycle Check Directed Graph

Breadth First Search

Bidirectional Dijkstra

Connected Components with Dsu

Hopcroft Karp

Is Graph Bipartite 2

Travelling Salesman Problem

Algoritmos codiciosos

Kruskals Minimum Spanning Tree

Prims Minimum Spanning Tree

Hashing

Double Hash Hash Table

Chaining

Linear Probing Hash Table

Quadratic Probing Hash Table

Álgebra lineal
Aprendizaje automático
Matemáticas

Matrix Exponentiation

Pascal Triangle

Armstrong Number

Runge Kutta

Qr Decomposition

Bisection Method

Large Factorial

Gcd Recursive Euclidean

Number of Positive Divisors

Finding Number of Digits in a Number

Gcd Iterative Euclidean

Magic Number

Sqrt Double

Large Number

Sum of Binomial Coefficient

Armstrong Number

Largest Power

Binary Exponent

Fibonacci Matrix Exponentiation

Check Prime

Primes up to Billion

Modular Exponentiation

Sieve of Eratosthenes

Sum of Digits

Complex Numbers

Fibonacci Large

Least Common Multiple

Integral Approximation

Integral Approximation 2

Binomial Calculate

Prime Factorization

Double Factorial

Power of Two

Ncr Modulo P

Eulers Totient Function

Check Amicable Pair

Check Factorial

Modular Inverse Fermat Little Theorem

Linear Recurrence Matrix

Power for Huge Numbers

Fibonacci Fast

String Fibonacci

Realtime Stats

Miller Rabin

Vector Cross Product

Gcd of N Numbers

Fibonacci Numbers

Fibonacci Sum

Extended Euclid Algorithm

Matriz

Spiral Print

Análisis numérico

Gaussian Elimination

Lu Decomposition

Métodos numéricos

Composite Simpson Rule

Ode Midpoint Euler

Midpoint Integral Method

Babylonian Method

Newton Raphson Method

Inverse Fast Fourier Transform

Fast Fourier Transform

Ode Forward Euler

Successive Approximation

Ode Semi Implicit Euler

Golden Search Extrema

Durand Kerner Roots

Brent Method Extrema

Operaciones en estructuras de datos
Otros

Easter

Vector Important Functions

Fast Integer Input

Kadanes 3

Paranthesis Matching

Lru Cache

Smallest Circle

Iterative Tree Traversals

Happy Number

Tower of Hanoi

Sparse Matrix

Stairs Pattern

Buzz Number

Palindrome of Number

Decimal to Roman Numeral

Probabilidad

Windowed Median

Binomial Dist

Geometric Dist

Poisson Dist

Bayes Theorem

Addition Rule

Consultas de rango

Prefix Sum Array

Heavy Light Decomposition

Persistent Seg Tree Lazy Prop

Búsquedas

Interpolation Search

Linear Search

+11

Más

Floyd Cycle Detection Algo

Hash Search

Exponential Search

Saddleback Search

Text Search

Binary Search

+12

Más

Sublist Search

Jump Search

Ternary Search

Fibonacci Search

Median Search

Interpolation Search 2

Ordenamiento

Random Pivot Quick Sort

Heap Sort

+13

Más

Pancake Sort

Quick Sort 3

Numeric String Sort

Odd Even Sort

Recursive Bubble Sort

Selection Sort Iterative

Shell Sort 2

Radix Sort 2

Comb Sort

Bubble Sort

+15

Más

Quick Sort

+17

Más

Selection Sort Recursive

Counting Sort

Insertion Sort

+15

Más

Radix Sort

Pigeonhole Sort

Gnome Sort

Shell Sort

Library Sort

Counting Sort String

Cycle Sort

Bitonic Sort

Bogo Sort

Merge Insertion Sort

Non Recursive Merge Sort

Wiggle Sort

Count Inversions

Bucket Sort

Cocktail Selection Sort

Strand Sort

Topological Sort

Cadenas

Rabin Karp

Horspool

Z Function

Manacher Algorithm

Knuth Morris Pratt

Brute Force String Searching

Hamming Distance