The Algorithms logoTheAlgorithms
AboutDonate
Backtracking

Sudoku Solve

Graph Coloring

Rat Maze

N Queens

Nqueen Print All Solutions

N Queens All Solution Optimised

Knight Tour

Bit Manipulation

Hamming Distance

Blockchain

Modular Division

Ciphers

Vigenere Cipher

Xor Cipher

Uint256 T

Hill Cipher

Uint128 T

Base64 Encoding

Morse Code

Elliptic Curve Key Exchange

Caesar Cipher

Compression
Conversions

Decimal to Hexadecimal

Decimal to Binary

+1

Data Structures

Circular Linked List

Lowest Common Ancestor

Linked List

Linkedlist Implentation Usingarray

Queue Using Two Stacks

Queue Using Linkedlist

Binary Search Tree2

Trie Modern

Trie Using Hashmap

Stack Using Linked List

List Array

Morrisinorder

Queue Using Array2

Queue Using Linkedlist

Queue Using Array

Doubly Linked List

+3

Circular Queue Using Linked List

Stack Using Array

Binaryheap

Binary Search Tree

+2

Postfix Evaluation

Dynamic Programming

+7

Catalan Numbers

Floyd Warshall

Searching of Element in Dynamic Array

Minimum Edit Distance

Edit Distance

+1

Longest Common String

Fibonacci Bottom Up

Longest Increasing Subsequence (Nlogn)

Palindrome Partitioning

Longest Increasing Subsequence

Matrix Chain Multiplication

Coin Change Topdown

Longest Common Subsequence

LongestPalindromicSubsequence

Egg Dropping Puzzle

Geometry

Line Segment Intersection

Jarvis Algorithm

Graphics

Spirograph

Graphs

Dijkstra

Bellman Ford

Topological Sort by Kahns Algo

Kosaraju

Depth First Search

Max Flow with Ford Fulkerson and Edmond Karp Algo

Connected Components with Dsu

Dijkstra

Bidirectional Dijkstra

Is Graph Bipartite

Connected Components

Breadth First Search

Cycle Check Directed Graph

Hopcroft Karp

Hamiltons Cycle

Kruskal

Depth First Search with Stack

Bridge Finding with Tarjan Algorithm

Prim

Greedy Algorithms

Kruskals Minimum Spanning Tree

Prims Minimum Spanning Tree

Hashing

Chaining

Double Hash Hash Table

Quadratic Probing Hash Table

Linear Probing Hash Table

Knapsack

Knapsack

Linear Algebra

Gram Schmidt

Machine Learning

Neural Network

Kohonen Som Topology

Kohonen Som Trace

A Star Search

Ordinary Least Squares Regressor

Adaline Learning

Math

Extended Euclid Algorithm

Sieve of Eratosthenes

EulersTotientFunction

Number of Positive Divisors

Ncr Modulo P

Realtime Stats

Double Factorial

Gcd Recursive Euclidean

Fibonacci Numbers

+8

Binomial Calculate

Linear Recurrence Matrix

Power for Huge Numbers

Check Amicable Pair

Largest Power

Large Number

Fibonacci Sum

Check Prime

Sqrt Double

Gcd of N Numbers

Prime Factorization

Sum of Digits

Fibonacci Fast

Primes up to Billion

Least Common Multiple

Sum of Binomial Coefficient

N Choose R

ArmstrongNumber

Large Factorial

Magic Number

String Fibonacci

Vector Cross Product

Power of Two

Fibonacci Matrix Exponentiation

Binary Exponent

Prime Numbers

Miller Rabin

Gcd Iterative Euclidean

Modular Inverse Fermat Little Theorem

Complex Numbers

Integral Approximation

Lcm Sum

Fibonacci Large

Check Factorial

Fast Power

Modular Exponentiation

ArmstrongNumber

Matrix Exponentiation

PascalTriangle

Qr Decomposition

Runge Kutta

Matrix

Spiral Print

Numerical Analysis

Lu Decomposition

Gaussian Elimination

Numerical Methods

Ode Midpoint Euler

Ode Forward Euler

Golden Search Extrema

Ode Semi Implicit Euler

Brent Method Extrema

Qr Decompose

Successive Approximation

Qr Eigen Values

Lu Decompose

Durand Kerner Roots

False Position

Newton Raphson Method

Bisection Method

Operations on Datastructures

Selectionsortlinkedlist

Array Right Rotation

Trie Multiple Search

Intersection of 2 Arrays

Reverse a Linked List Using Recusion

Circular Queue Using Array

Get Size of Linked List

Array Left Rotation

Others

Paranthesis Matching

Vector Important Functions

Stairs Pattern

Palindrome of Number

Smallest Circle

Buzz Number

Fast Integer Input

Tower of Hanoi

Happy Number

Sparse Matrix

Decimal to Roman Numeral

Probability

Poisson Dist

Binomial Dist

Addition Rule

Bayes Theorem

Range Queries

Sparse Table

Persistent Seg Tree Lazy Prop

Heavy Light Decomposition

Sparse Table

Searches

Linear Search

+10

Jump Search

+3

Text Search

Binary Search

+11

Fibonacci Search

Interpolation Search

+2

Exponential Search

Hash Search

Ternary Search

+2

Saddleback Search

Median Search

Interpolation Search2

Sorts

Topological Sort

Bead Sort

Strand Sort

Swap Sort

Library Sort

Comb Sort

+6

Cycle Sort

+1

Quick Sort

+13

Insertion Sort

+13

Pancake Sort

+2

Counting Sort String

Quick Sort 3

Non Recursive Merge Sort

Odd Even Sort

Recursive Bubble Sort

Count Inversions

Pigeonhole Sort

Selection Sort

+12

Bucket Sort

+1

Slowsort

Numeric String Sort

Tim Sort

Radix Sort

+7

Wiggle Sort

Counting Sort

+3

Shell Sort

+7

Heap Sort

+11

Merge Insertion Sort

Bubble Sort

+15

Cocktail Selection Sort

Radix Sort2

Gnome Sort

+3

Merge Sort

+14

Bitonic Sort

Shell Sort2

Bogo Sort

+2

Strings

Horspool

Knuth Morris Pratt

Rabin Karp

Brute Force String Searching