mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
f821fae698
* Add files via upload # Class Based DSU -Using Path Compression to get the best time complexity O(1) -Using Union Rank to keep track of changes using parent(p) O(logN) * Class based DSU : Path Compression O(1) and Union Rank O(logN) * made changes to satisfy the meets of the PR changes made to satisfy the needs of the PR - used base lib instead of <bits/stdc++.h> - changed all stdin's and included pre-declared test cases * removed stdin for testing * changed file name from upper case to lower case * made necessary changes * Delete DSU_union_rank.cpp * Delete DSU_path_compresssion.cpp * added explicit to contructors, return 0, n=dec * Delete dsu_path_compresssion.cpp * added documentations, to match the typical structure Added @brief @details @author @param @returns * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * added self-implementation test cases, changed int to uint64_t * std::cout after assert * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * updating DIRECTORY.md * clang-format and clang-tidy fixes forb8c37d09* Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * documentation changes * Update dsu_union_rank.cpp * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * clang-format and clang-tidy fixes for18843179* Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * clang-format and clang-tidy fixes for5c24d9a9* Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com> Co-authored-by: Ayaan Khan <ayaankhan98@gmail.com>
35 KiB
35 KiB
Backtracking
- 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 Solve
- Wildcard Matching
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
Data Structures
- Avltree
- Binary Search Tree
- Binary Search Tree2
- Binaryheap
- Circular Queue Using Linked List
- Cll
- Disjoint Set
- Doubly Linked List
- Dsu Path Compression
- Dsu Union Rank
- 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
- Rb Tree
- Reverse A Linked List
- Skip List
- Sparse Table
- Stack
- Stack Using Array
- Stack Using Linked List
- Stack Using Queue
- Test Queue
- Test Stack
- Test Stack Students
- Tree
- Tree 234
- Trie Modern
- Trie Tree
- Trie Using Hashmap
Divide And Conquer
Dynamic Programming
- 0 1 Knapsack
- Abbreviation
- Armstrong Number
- Bellman Ford
- Catalan Numbers
- Coin Change
- Coin Change Topdown
- Cut Rod
- Edit Distance
- Egg Dropping Puzzle
- Fibonacci Bottom Up
- Floyd Warshall
- House Robber
- Kadane
- Kadane2
- Longest Common String
- Longest Common Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence (Nlogn)
- Longest Palindromic Subsequence
- Matrix Chain Multiplication
- Minimum Edit Distance
- 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
- Travelling Salesman Problem
Graphics
Greedy Algorithms
Hashing
Linear Algebra
Machine Learning
- A Star Search
- Adaline Learning
- Kohonen Som Topology
- Kohonen Som Trace
- Neural Network
- Ordinary Least Squares Regressor
- Vector Ops
Math
- Armstrong Number
- Binary Exponent
- Binomial Calculate
- 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
- Finding Number Of Digits In A Number
- Gcd Iterative Euclidean
- Gcd Of N Numbers
- Gcd Recursive Euclidean
- Integral Approximation
- Integral Approximation2
- Inv Sqrt
- 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
- N Bonacci
- 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
- 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
- Lru Cache
- 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
- Fenwick Tree
- Heavy Light Decomposition
- Mo
- Persistent Seg Tree Lazy Prop
- Prefix Sum Array
- Segtree
- Sparse Table
Search
- Binary Search
- Exponential Search
- Fibonacci Search
- Floyd Cycle Detection Algo
- Hash Search
- Interpolation Search
- Interpolation Search2
- Jump Search
- Linear Search
- Median Search
- Saddleback Search
- Sublist 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
- Dnf 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
- Random Pivot Quick Sort
- Recursive Bubble Sort
- Selection Sort
- Selection Sort Recursive
- Shell Sort
- Shell Sort2
- Slow Sort
- Strand Sort
- Swap Sort
- Tim Sort
- Wave Sort
- Wiggle Sort