mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
0ce5df0c21
* Added bit manipulation algorithms. * Removed Power of 2 and xor swap. * Update bit_manipulation/hamming_distance.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update bit_manipulation/hamming_distance.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update bit_manipulation/hamming_distance.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * updating DIRECTORY.md * clang-format and clang-tidy fixes forae4d4707* Apply suggestions from code review Co-authored-by: David Leal <halfpacho@gmail.com> * test: docs: Added tests and docs for hamming distance. * Apply suggestions from code review Co-authored-by: David Leal <halfpacho@gmail.com> * clang-format and clang-tidy fixes for94fb407b* Update bit_manipulation/hamming_distance.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * feat: Added string method for hamming distance. * Apply suggestions from code review Co-authored-by: David Leal <halfpacho@gmail.com> * clang-format and clang-tidy fixes for455dce1d* fix: Make hamming distance algorithm work for all strings. * clang-format and clang-tidy fixes forba18ec04Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
29 KiB
29 KiB
List of all files
Backtracking
- Graph Coloring
- Knight Tour
- Minimax
- N Queens
- N Queens All Solution Optimised
- Nqueen Print All Solutions
- Rat Maze
- Sudoku Solve
Bit Manipulation
Ciphers
Data Structures
- Avltree
- Binary Search Tree
- Binary Search Tree2
- Binaryheap
- Circular Queue Using Linked List
- Cll
- Disjoint Set
- Doubly Linked List
- Linked List
- Linkedlist Implentation Usingarray
- List Array
- Morrisinorder
- Queue
- Queue Using Array
- Queue Using Array2
- Queue Using Linked List
- Queue Using Linkedlist
- Queue Using Two Stacks
- Skip List
- Stack
- Stack Using Array
- Stack Using Linked List
- Test Queue
- Test Stack
- Test Stack Students
- Tree
- Tree 234
- Trie Modern
- Trie Tree
Dynamic Programming
- 0 1 Knapsack
- Armstrong Number
- Bellman Ford
- Catalan Numbers
- Coin Change
- Coin Change Topdown
- Cut Rod
- Edit Distance
- Egg Dropping Puzzle
- Fibonacci Bottom Up
- Floyd Warshall
- Kadane
- Kadane2
- Longest Common String
- Longest Common Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence (Nlogn)
- Longest Palindromic Subsequence
- Matrix Chain Multiplication
- Palindrome Partitioning
- Searching Of Element In Dynamic Array
- Shortest Common Supersequence
- Tree Height
- Word Break
Geometry
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
- Kosaraju
- Kruskal
- Lowest Common Ancestor
- Max Flow With Ford Fulkerson And Edmond Karp Algo
- Prim
- Topological Sort
- Topological Sort By Kahns Algo
Graphics
Greedy Algorithms
Hashing
Linear Algebra
Machine Learning
- Adaline Learning
- Kohonen Som Topology
- Kohonen Som Trace
- Neural Network
- Ordinary Least Squares Regressor
- Vector Ops
Math
- Armstrong Number
- Binary Exponent
- Check Amicable Pair
- Check Factorial
- Check Prime
- Complex Numbers
- Double Factorial
- Eulers Totient Function
- Extended Euclid Algorithm
- Factorial
- Fast Power
- Fibonacci
- 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
- Least Common Multiple
- Magic Number
- Miller Rabin
- Modular Division
- 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
- Prime Numbers
- Primes Up To Billion
- Realtime Stats
- Sieve Of Eratosthenes
- Sqrt Double
- String Fibonacci
- Sum Of Binomial Coefficient
- Sum Of Digits
- Vector Cross Product
Numerical Methods
- Bisection Method
- Brent Method Extrema
- Durand Kerner Roots
- False Position
- Gaussian Elimination
- Golden Search Extrema
- Lu Decompose
- Lu Decomposition
- 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
- 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 Integer Input
- Happy Number
- Matrix Exponentiation
- Palindrome Of Number
- Paranthesis Matching
- Pascal Triangle
- Postfix Evaluation
- Primality Test
- Smallest Circle
- Sparse Matrix
- Spiral Print
- Stairs Pattern
- Tower Of Hanoi
- Vector Important Functions
Probability
Range Queries
Search
- Binary Search
- Exponential Search
- Fibonacci Search
- Hash Search
- Interpolation Search
- Interpolation Search2
- Jump Search
- Linear Search
- Median Search
- Saddleback Search
- Ternary Search
- Text Search
Sorting
- Bead Sort
- Bitonic Sort
- Bogo Sort
- Bubble Sort
- Bucket Sort
- Cocktail Selection Sort
- Comb Sort
- Count Inversions
- Counting Sort
- Counting Sort String
- Cycle Sort
- Gnome Sort
- Heap Sort
- Insertion Sort
- 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
- Radix Sort
- Radix Sort2
- Selection Sort
- Shell Sort
- Shell Sort2
- Slow Sort
- Strand Sort
- Swap Sort
- Tim Sort
- Wiggle Sort