The Algorithms logo
The Algorithms
AboutDonate
Backtracking
Bit Manipulation
Checksum
Ciphers

Diffiehellmankeyexchange

Polybius

Transposition

Constraints

Contraints

Conversions

Integer To Roman

Roman To Integer

Binary to Decimal

Decimal to Binary

Data Structures
Divide and Conquer

Max Subarray Sum

Dynamic
Dynamic Programming

Longest Common Subsequence

Longest Palindromic Subsequence

Fibonacci Numbers

Longest Increasing Subsequence

Fibonacci Numbers

Graphs

Dijkstra

Topological

Depth First Search

Backtracking

Bellman Ford

Kruskal

Breadth First Search

Articulation Points

Hashing
Math

Binomial Coefficient

Matrix Multiplication

Kthnumber

Pythagoras

Fastexponent

Powvialogarithm

Logarithm

Bitcounter

Xorsearch

Checkisnumberpoweroftwo

Arithmetic Mean

Exponentiation

Prime Check

Prime Factorization

Millerrabintest

Eulertotient

Checkisnumberpoweroftwo

Straightlines

Extendedgcd

Gcditerative

Extended

Extendedgcditerative

Spigotpi

Montecarlopi

Pascal Triangle

Bitwisemin

Bitwisemax

Others

Catalan

Is Armstrong

Nested Brackets

Searches
Sorts

Shell Sort

Quick Sort

+17

More

Simple Sort

Selection Sort

+13

More

Merge Sort

+17

More

Exchange Sort

Radix Sort

Pigeonhole Sort

Bubble Sort

+17

More

Heap Sort

+13

More

Counting Sort

Comb Sort

Insertion Sort

+16

More
Strings

Generateparentheses

Boyer Moore

Longestpalindrome

Horspool

Is Palindrome

Advancedahocorasick

Aho Corasick

Levenshtein Distance

Structure