The Algorithms logo
The Algorithms
AboutDonate
undefined

Constraints

Knapsack

Backtracking

Generate Parentheses

Combination

Bit Manipulation
Cache
Checksum
Ciphers

Polybius

XOR Cipher

Transposition

Diffiehellmankeyexchange

Compression

Huffmancoding

Conversions

Integer To Roman

Roman To Integer

Decimal to Binary

Binary to Decimal

Data Structures
Divide and Conquer
Dynamic

Longestincreasingsubsequencegreedy

Dynamic Programming

Floyd Warshall

Longest Common Subsequence

Longest Increasing Subsequence

Longest Palindromic Subsequence

Graphs

Articulation Points

Breadth First Search

Backtracking

Topological

Bellman Ford

Dijkstra

Kruskal

Depth First Search

Hashing
Math

Armstrong Number

Perfect Number

Catalan Number

Montecarlopi

Spigotpi

Mobius

Straightlines

Binomial Coefficient

Extended

Extendedgcditerative

Gcditerative

Extendedgcd

Pythagoras

Euler's Totient

Prime Factorization

Millerrabintest

Liouville

Checkisnumberpoweroftwo

Fastexponent

Powvialogarithm

Fibonacci Numbers

+10

More

Pronic Number

Bitwisemin

Exponentiation

Aliquot Sum

Median

Pollard

Kthnumber

Logarithm

Bitcounter

Checkisnumberpoweroftwo

Arithmetic Mean

Xorsearch

Factorial

+11

More

Bitwisemax

Matrix Multiplication

Catalan

Binomial Coefficient

Fibonacci Numbers

+10

More
Matrix

Pascal Triangle

Numerical Methods
Others

Krishnamurthy

Nested Brackets

Searches
Sorts

Selection Sort

+13

More

Insertion Sort

+17

More

Comb Sort

Cycle Sort

Exchange Sort

Pigeonhole Sort

Counting Sort

Quick Sort

+18

More

Shell Sort

Radix Sort

Bubble Sort

+18

More

Bucket Sort

Simple Sort

Pancake Sort

Heap Sort

+12

More

Patience Sort

Strings

Is Isogram

Horspool

Longestpalindrome

Levenshtein Distance

Is Pangram

Boyer Moore

Aho Corasick

Advancedahocorasick

Charoccurrence

Structure