mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
00e49027ef
* document/math: document square-root that uses bisection method math readme title documentation and bug fixes fix cpplint docs for large number power documetnation for positive divisors documentation for Little Fermat's Thm updating DIRECTORY.md document fibonacci program better document GCD programs improve documentation for fast_power use template based functions documentation for extended euclid fix code for generic types documentation for eulers_totient_function.cpp documentation update for double_factorial fix documentation for double_factorial bug fix - no function return and invalid for loop termination check documentation for double_factorial documetnation for binary_exponent.cpp
20 KiB
20 KiB
Backtracking
- Graph Coloring
- Knight Tour
- Minimax
- N Queens
- N Queens All Solution Optimised
- Nqueen Print All Solutions
- Rat Maze
- Sudoku Solve
Computer Oriented Statistical Methods
- Bisection Method
- False Position
- Gaussian Elimination
- Newton Raphson Method
- Ordinary Least Squares Regressor
- Secant Method
- Successive Approximation
Data Structure
- Avltree
- Binary Search Tree
- Binaryheap
- Circular Queue Using Linked List
- Cll
- Disjoint Set
- Doubly Linked List
- Linked List
- Linkedlist Implentation Usingarray
- List Array
- Morrisinorder
- Queue Using Array
- Queue Using Linked List
- Queue
- Queue Using Array
- Queue Using Linkedlist
- Stack Using Array
- Stack Using Linked List
- Stk
- Tree
- Trie Tree
Dynamic Programming
- 0-1 Knapsack
- Armstrong Number
- Bellman-Ford
- Catalan-Numbers
- Coin-Change
- Cut Rod
- Edit Distance
- Egg-Dropping-Puzzle
- Fibonacci Bottom Up
- Fibonacci Top Down
- Floyd-Warshall
- Kadane
- Longest Common Subsequence
- Longest Increasing Subsequence (Nlogn)
- Longest Increasing Subsequence
- Longest Common String
- Matrix-Chain-Multiplication
- Searching Of Element In Dynamic Array
- Tree Height
Graph
- Bfs
- Bridge Finding With Tarjan Algorithm
- Connected Components
- Connected Components With Dsu
- Dfs
- Dfs With Stack
- Dijkstra
- Kosaraju
- Kruskal
- Lca
- Max Flow With Ford Fulkerson And Edmond Karp Algo
- Prim
- Topological-Sort
- Topological Sort By Kahns Algo
Greedy Algorithms
Hashing
Math
- Binary Exponent
- Double Factorial
- Eulers Totient Function
- Extended Euclid Algorithm
- Factorial
- Fast Power
- Fibonacci
- Gcd Iterative Euclidean
- Gcd Recursive Euclidean
- Modular Inverse Fermat Little Theorem
- Number Of Positive Divisors
- Power For Huge Numbers
- Prime Factorization
- Prime Numbers
- Primes Up To Billion
- Sieve Of Eratosthenes
- Sqrt Double
Operations On Datastructures
- Array Left Rotation
- Array Right Rotation
- Circular Linked List
- Circular Queue Using Array
- Get Size Of Linked List
- Intersection Of 2 Arrays
- Reverse A Linked List Using Recusion
- Selectionsortlinkedlist
- Union Of 2 Arrays
Others
- Buzz Number
- Decimal To Binary
- Decimal To Hexadecimal
- Decimal To Roman Numeral
- Fast Interger Input
- Fibonacci Fast
- Gcd Of N Numbers
- Happy Number
- Large Factorial
- Large Number
- Matrix Exponentiation
- Palindrome Of Number
- Paranthesis Matching
- Pascal Triangle
- Primality Test
- Sieve Of Eratosthenes
- Smallest-Circle
- Sparse Matrix
- Spiral Print
- Stairs Pattern
- String Fibonacci
- Tower Of Hanoi
- Vector Important Functions
Probability
Range Queries
Search
- Binary Search
- Exponential Search
- Hash Search
- Interpolation Search
- Interpolation Search2
- Jump Search
- Linear Search
- Median Search
- Searching
- Ternary Search
Sorting
- Bead Sort
- Bitonic Sort
- Bubble Sort
- Bucket Sort
- Cocktail Selection Sort
- Comb Sort
- Counting Sort
- Counting Sort String
- Heap Sort
- Insertion Sort
- Library Sort
- Merge Sort
- Non Recursive Merge Sort
- Numeric String Sort
- Odd Even Sort
- Quick Sort
- Radix Sort
- Selection Sort
- Shell Sort
- Shell Sort2
- Slow Sort
- Swap Sort
- Tim Sort