TheAlgorithms/C++
1.0.0
All the algorithms implemented in C++
Loading...
Searching...
No Matches
Backtracking
Generate Parentheses
Graph Coloring
Knight Tour
Magic Sequence
Minimax
N Queens
N Queens All Solution Optimised
Nqueen Print All Solutions
Rat Maze
Subarray Sum
Subset Sum
Sudoku Solver
Wildcard Matching
Bit Manipulation
Count Bits Flip
Count Of Set Bits
Count Of Trailing Ciphers In Factorial N
Find Non Repeating Number
Gray Code
Hamming Distance
Next Higher Number With Same Number Of Set Bits
Power Of 2
Set Kth Bit
Travelling Salesman Using Bit Manipulation
Ciphers
A1Z26 Cipher
Atbash Cipher
Base64 Encoding
Caesar Cipher
Elliptic Curve Key Exchange
Hill Cipher
Morse Code
Uint128 T
Uint256 T
Vigenere Cipher
Xor Cipher
Cpu Scheduling Algorithms
Fcfs Scheduling
Non Preemptive Sjf Scheduling
Data Structures
Avltree
Binary Search Tree
Binary Search Tree2
Binaryheap
Bloom Filter
Circular Queue Using Linked List
Cll
Cll
Cll
Main Cll
Disjoint Set
Doubly Linked List
Dsu Path Compression
Dsu Union Rank
Linked List
Linkedlist Implentation Usingarray
List Array
Morrisinorder
Node
Queue
Queue Using Array
Queue Using Array2
Queue Using Linked List
Queue Using Linkedlist
Queue Using Two Stacks
Rb Tree
Reverse A Linked List
Segment Tree
Skip List
Sparse Table
Stack
Stack Using Array
Stack Using Linked List
Stack Using Queue
Test Queue
Test Stack
Test Stack Students
Treap
Tree
Tree 234
Trie Modern
Trie Tree
Trie Using Hashmap
Divide And Conquer
Karatsuba Algorithm For Fast Multiplication
Strassen Matrix Multiplication
Dynamic Programming
0 1 Knapsack
Abbreviation
Armstrong Number Templated
Bellman Ford
Catalan Numbers
Coin Change
Coin Change Topdown
Cut Rod
Edit Distance
Egg Dropping Puzzle
Fibonacci Bottom Up
Floyd Warshall
House Robber
Kadane
Longest Common String
Longest Common Subsequence
Longest Increasing Subsequence
Longest Increasing Subsequence Nlogn
Longest Palindromic Subsequence
Matrix Chain Multiplication
Maximum Circular Subarray
Minimum Edit Distance
Palindrome Partitioning
Partition Problem
Searching Of Element In Dynamic Array
Shortest Common Supersequence
Subset Sum Dynamic
Trapped Rainwater
Tree Height
Unbounded 0 1 Knapsack
Word Break
Games
Memory Game
Geometry
Graham Scan Algorithm
Graham Scan Functions
Jarvis Algorithm
Line Segment Intersection
Graph
Bidirectional Dijkstra
Breadth First Search
Bridge Finding With Tarjan Algorithm
Connected Components
Connected Components With Dsu
Cycle Check Directed Graph
Depth First Search
Depth First Search With Stack
Dijkstra
Hamiltons Cycle
Hopcroft Karp
Is Graph Bipartite
Is Graph Bipartite2
Kosaraju
Kruskal
Lowest Common Ancestor
Max Flow With Ford Fulkerson And Edmond Karp Algo
Prim
Topological Sort
Topological Sort By Kahns Algo
Travelling Salesman Problem
Graphics
Spirograph
Greedy Algorithms
Binary Addition
Boruvkas Minimum Spanning Tree
Digit Separation
Dijkstra Greedy
Gale Shapley
Huffman
Jump Game
Knapsack
Kruskals Minimum Spanning Tree
Prims Minimum Spanning Tree
Hashing
Chaining
Double Hash Hash Table
Linear Probing Hash Table
Md5
Quadratic Probing Hash Table
Sha1
Sha256
Machine Learning
A Star Search
Adaline Learning
K Nearest Neighbors
Kohonen Som Topology
Kohonen Som Trace
Neural Network
Ordinary Least Squares Regressor
Vector Ops
Math
Aliquot Sum
Approximate Pi
Area
Armstrong Number
Binary Exponent
Binomial Calculate
Check Amicable Pair
Check Factorial
Check Prime
Complex Numbers
Double Factorial
Eratosthenes
Eulers Totient Function
Extended Euclid Algorithm
Factorial
Fast Power
Fibonacci
Fibonacci Fast
Fibonacci Large
Fibonacci Matrix Exponentiation
Fibonacci Sum
Finding Number Of Digits In A Number
Gcd Iterative Euclidean
Gcd Of N Numbers
Gcd Recursive Euclidean
Integral Approximation
Integral Approximation2
Inv Sqrt
Iterative Factorial
Large Factorial
Large Number
Largest Power
Lcm Sum
Least Common Multiple
Linear Recurrence Matrix
Magic Number
Miller Rabin
Modular Division
Modular Exponentiation
Modular Inverse Fermat Little Theorem
Modular Inverse Simple
N Bonacci
N Choose R
Ncr Modulo P
Number Of Positive Divisors
Perimeter
Power For Huge Numbers
Power Of Two
Prime Factorization
Prime Numbers
Primes Up To Billion
Quadratic Equations Complex Numbers
Realtime Stats
Sieve Of Eratosthenes
Sqrt Double
String Fibonacci
Sum Of Binomial Coefficient
Sum Of Digits
Vector Cross Product
Volume
Numerical Methods
Babylonian Method
Bisection Method
Brent Method Extrema
Composite Simpson Rule
Durand Kerner Roots
False Position
Fast Fourier Transform
Gaussian Elimination
Golden Search Extrema
Gram Schmidt
Inverse Fast Fourier Transform
Lu Decompose
Lu Decomposition
Midpoint Integral Method
Newton Raphson Method
Ode Forward Euler
Ode Midpoint Euler
Ode Semi Implicit Euler
Qr Decompose
Qr Decomposition
Qr Eigen Values
Rungekutta
Successive Approximation
Operations On Datastructures
Array Left Rotation
Array Right Rotation
Circular Linked List
Circular Queue Using Array
Get Size Of Linked List
Inorder Successor Of Bst
Intersection Of Two Arrays
Reverse A Linked List Using Recusion
Reverse Binary Tree
Selectionsortlinkedlist
Trie Multiple Search
Union Of Two Arrays
Others
Buzz Number
Decimal To Binary
Decimal To Hexadecimal
Decimal To Roman Numeral
Easter
Fast Integer Input
Happy Number
Iterative Tree Traversals
Kadanes3
Kelvin To Celsius
Lfu Cache
Longest Substring Without Repeating Characters
Lru Cache
Lru Cache2
Matrix Exponentiation
Palindrome Of Number
Paranthesis Matching
Pascal Triangle
Postfix Evaluation
Primality Test
Recursive Tree Traversal
Smallest Circle
Sparse Matrix
Spiral Print
Stairs Pattern
Tower Of Hanoi
Vector Important Functions
Physics
Ground To Ground Projectile Motion
Probability
Addition Rule
Bayes Theorem
Binomial Dist
Exponential Dist
Geometric Dist
Poisson Dist
Windowed Median
Range Queries
Fenwick Tree
Heavy Light Decomposition
Mo
Persistent Seg Tree Lazy Prop
Prefix Sum Array
Segtree
Sparse Table Range Queries
Search
Binary Search
Exponential Search
Fibonacci Search
Floyd Cycle Detection Algo
Hash Search
Interpolation Search
Interpolation Search2
Jump Search
Linear Search
Longest Increasing Subsequence Using Binary Search
Median Search
Median Search2
Saddleback Search
Sublist Search
Ternary Search
Text Search
Sorting
Bead Sort
Binary Insertion Sort
Bitonic Sort
Bogo Sort
Bubble Sort
Bucket Sort
Cocktail Selection Sort
Comb Sort
Count Inversions
Counting Sort
Counting Sort String
Cycle Sort
Dnf Sort
Gnome Sort
Heap Sort
Insertion Sort
Insertion Sort Recursive
Library Sort
Merge Insertion Sort
Merge Sort
Non Recursive Merge Sort
Numeric String Sort
Odd Even Sort
Pancake Sort
Pigeonhole Sort
Quick Sort
Quick Sort 3
Quick Sort Iterative
Radix Sort
Radix Sort2
Random Pivot Quick Sort
Recursive Bubble Sort
Selection Sort Iterative
Selection Sort Recursive
Shell Sort
Shell Sort2
Slow Sort
Stooge Sort
Strand Sort
Swap Sort
Tim Sort
Wave Sort
Wiggle Sort
Strings
Boyer Moore
Brute Force String Searching
Duval
Horspool
Knuth Morris Pratt
Manacher Algorithm
Rabin Karp
Z Function
Generated by
1.12.0