The Algorithms logoTheAlgorithms
AboutGitterGitHubTwitter

C++

arithmeticanalysis

Gaussian Elimination

Lu Decomposition

backtracking

Knight Tour

Graph Coloring

N Queens All Solution Optimised

Nqueen Print All Solutions

Sudoku Solve

bitmanipulation

Hamming Distance

blockchain

Modular Division

ciphers

Caesar Cipher

Hill Cipher

Vigenere Cipher

Xor Cipher

Morse Code

compression
conversions

Decimal To Binary

Decimal To Hexadecimal

datastructures

Binary Search Tree

+1

Lowest Common Ancestor

Prime Numbers

Circular Linked List

Doubly Linked List

+2

Postfix Evaluation

Binary Search Tree2

Circular Queue Using Linked List

Linkedlist Implentation Usingarray

Morrisinorder

Queue Using Array

Queue Using Array2

Queue Using Linked List

Queue Using Two Stacks

Stack Using Array

Stack Using Linked List

Test Stack Students

divideandconquer
dynamicprogramming

Longest Common Subsequence

Longest Increasing Subsequence

LongestPalindromicSubsequence

Coin Change Topdown

Egg Dropping Puzzle

Fibonacci Bottom Up

Longest Common String

Longest Increasing Subsequence (Nlogn)

Matrix Chain Multiplication

Palindrome Partitioning

Searching Of Element In Dynamic Array

Shortest Common Supersequence

geometry

Jarvis Algorithm

Line Segment Intersection

graph

Bidirectional Dijkstra

Bridge Finding With Tarjan Algorithm

Connected Components With Dsu

Cycle Check Directed Graph

Depth First Search With Stack

Hamiltons Cycle

Hopcroft Karp

Is Graph Bipartite

Kosaraju

Kruskal

Max Flow With Ford Fulkerson And Edmond Karp Algo

Topological Sort By Kahns Algo

graphics

Spirograph

graphs

Bellman Ford

Breadth First Search

Connected Components

Depth First Search

Dijkstra

greedyalgorithms

Kruskals Minimum Spanning Tree

Prims Minimum Spanning Tree

hashing

Chaining

Double Hash Hash Table

Linear Probing Hash Table

Quadratic Probing Hash Table

linearalgebra

Gram Schmidt

machinelearning

Adaline Learning

Kohonen Som Topology

Kohonen Som Trace

Neural Network

Ordinary Least Squares Regressor

math

Binary Exponent

Binomial Calculate

Check Amicable Pair

Check Factorial

Check Prime

Complex Numbers

Double Factorial

Extended Euclid Algorithm

Fast Power

Fibonacci Fast

Fibonacci Large

Fibonacci Matrix Exponentiation

Fibonacci Sum

Gcd Iterative Euclidean

Gcd Of N Numbers

Gcd Recursive Euclidean

Large Factorial

Large Number

Largest Power

Lcm Sum

Magic Number

Modular Exponentiation

Modular Inverse Fermat Little Theorem

N Choose R

Ncr Modulo P

Number Of Positive Divisors

Power For Huge Numbers

Power Of Two

Prime Factorization

Primes Up To Billion

Realtime Stats

Sqrt Double

String Fibonacci

Sum Of Binomial Coefficient

Vector Cross Product

maths

Least Common Multiple

Matrix Exponentiation

Miller Rabin

Qr Decomposition

Runge Kutta

Sieve Of Eratosthenes

Sum Of Digits

ArmstrongNumber

EulersTotientFunction

PascalTriangle

matrix

Spiral Print

numericalmethods

Bisection Method

Brent Method Extrema

Durand Kerner Roots

False Position

Golden Search Extrema

Newton Raphson Method

Ode Forward Euler

Ode Midpoint Euler

Ode Semi Implicit Euler

Qr Eigen Values

Successive Approximation

operationsondatastructures

Circular Queue Using Array

Get Size Of Linked List

Intersection Of 2 Arrays

Reverse A Linked List Using Recusion

Selectionsortlinkedlist

other

Tower Of Hanoi

others

Buzz Number

Decimal To Roman Numeral

Fast Integer Input

Happy Number

Palindrome Of Number

Paranthesis Matching

Primality Test

Smallest Circle

Sparse Matrix

Stairs Pattern

Vector Important Functions

probability

Addition Rule

Bayes Theorem

Binomial Dist

Poisson Dist

rangequeries

Heavy Light Decomposition

Persistent Seg Tree Lazy Prop

Sparse Table

search

ExponentialSearch

Hash Search

Interpolation Search2

Median Search

Saddleback Search

Text Search

searches

Binary Search

+9

Fibonacci Search

Interpolation Search

Jump Search

+2

Linear Search

+8

Ternary Search

+1

sorting

Cocktail Selection Sort

Count Inversions

Counting Sort String

Library Sort

Non Recursive Merge Sort

Numeric String Sort

Odd Even Sort

Quick Sort 3

Radix Sort2

Shell Sort2

Slow Sort

Swap Sort

sorts

Bead Sort

Bitonic Sort

Bogo Sort

+1

Bubble Sort

+12

Bucket Sort

Comb Sort

+4

Counting Sort

+2

Cycle Sort

Gnome Sort

+3

Heap Sort

+10

Insertion Sort

+10

Merge Insertion Sort

Pancake Sort

Pigeonhole Sort

Quick Sort

+11

Radix Sort

+6

Selection Sort

+9

Shell Sort

+6

Strand Sort

Tim Sort

Topological Sort

Wiggle Sort

strings

Knuth Morris Pratt

Rabin Karp

Brute Force String Searching

Horspool

The Algorithms logo

© The Algorithms 2021

What is an algorithm?About usProgramming LanguagesContributeSource code
GitHubGitterTwitterAll algorithms
Powered by