The Algorithms logo
The Algorithms
AboutDonate
Backtracking
Bit Manipulation
Checksum
Ciphers

Diffiehellmankeyexchange

Transposition

Polybius

Constraints

Contraints

Conversions

Roman To Integer

Decimal to Binary

Integer To Roman

Binary to Decimal

Data Structures
Divide and Conquer

Max Subarray Sum

Dynamic

Longestincreasingsubsequencegreedy

Dynamic Programming

Fibonacci Numbers

Longest Palindromic Subsequence

Fibonacci Numbers

Longest Increasing Subsequence

Longest Common Subsequence

Graphs

Articulation Points

Bellman Ford

Breadth First Search

Depth First Search

Backtracking

Topological

Dijkstra

Kruskal

Hashing
Math

Straightlines

Bitwisemax

Fastexponent

Powvialogarithm

Exponentiation

Pascal Triangle

Montecarlopi

Spigotpi

Checkisnumberpoweroftwo

Eulertotient

Kthnumber

Checkisnumberpoweroftwo

Logarithm

Arithmetic Mean

Bitcounter

Xorsearch

Pythagoras

Bitwisemin

Millerrabintest

Prime Factorization

Prime Check

Extendedgcditerative

Gcditerative

Extended

Extendedgcd

Binomial Coefficient

Matrix Multiplication

Others
Searches
Sorts

Exchange Sort

Simple Sort

Heap Sort

+13

More

Quick Sort

+17

More

Comb Sort

Counting Sort

Radix Sort

Merge Sort

+17

More

Selection Sort

+13

More

Bubble Sort

+17

More

Pigeonhole Sort

Insertion Sort

+16

More

Shell Sort

Strings

Levenshtein Distance

Advancedahocorasick

Aho Corasick

Boyer Moore

Horspool

Longestpalindrome

Generateparentheses

Structure