Merge branch 'main' of github.com:iagorrr/Competitive-Programming-Alg…

…orithms

README.md

@@ -27,22 +27,22 @@ You can find a little explanation about each algorithm at the [PDF Notebook](not
 - Segtree Point Update (Bottom Up)
     - [query max subarray sum](/algorithms/data-structures/segtree-point-update-(bottom-up)/query-max-subarray-sum.cpp)
     - [struct](/algorithms/data-structures/segtree-point-update-(bottom-up)/struct.cpp)
-    - [query sum](/algorithms/data-structures/segtree-point-update-(bottom-up)/query-sum.cpp)
     - [query min](/algorithms/data-structures/segtree-point-update-(bottom-up)/query-min.cpp)
+    - [query sum](/algorithms/data-structures/segtree-point-update-(bottom-up)/query-sum.cpp)
 
 - Segtree Point Update (Top Down)
     - [struct](/algorithms/data-structures/segtree-point-update-(top-down)/struct.cpp)
-    - [query sum](/algorithms/data-structures/segtree-point-update-(top-down)/query-sum.cpp)
     - [query hash](/algorithms/data-structures/segtree-point-update-(top-down)/query-hash.cpp)
+    - [query sum](/algorithms/data-structures/segtree-point-update-(top-down)/query-sum.cpp)
 
 - Segtree Range Update (Bottom Up)
     - [increment update query sum](/algorithms/data-structures/segtree-range-update-(bottom-up)/increment-update-query-sum.cpp)
 
 - Segtree Range Update (Top Down)
-    - [increment update max query](/algorithms/data-structures/segtree-range-update-(top-down)/increment-update-max-query.cpp)
+    - [segtree PA](/algorithms/data-structures/segtree-range-update-(top-down)/segtree-PA.cpp)
     - [struct](/algorithms/data-structures/segtree-range-update-(top-down)/struct.cpp)
     - [set and increment update sum query](/algorithms/data-structures/segtree-range-update-(top-down)/set-and-increment-update-sum-query.cpp)
-    - [segtree PA](/algorithms/data-structures/segtree-range-update-(top-down)/segtree-PA.cpp)
+    - [increment update max query](/algorithms/data-structures/segtree-range-update-(top-down)/increment-update-max-query.cpp)
 
 - Sqrt_Decomposition
     - [two sequence queries](/algorithms/data-structures/sqrt_decomposition/two-sequence-queries.cpp)
@@ -63,11 +63,11 @@ You can find a little explanation about each algorithm at the [PDF Notebook](not
 #### Dynamic Programming
 - Digits
     - [no consecutive equal](/algorithms/dynamic-programming/digits/no-consecutive-equal.cpp)
-    - [no 13 and 4 as substr](/algorithms/dynamic-programming/digits/no-13-and-4-as-substr.cpp)
-    - [product of digits less equal than k](/algorithms/dynamic-programming/digits/product-of-digits-less-equal-than-k.cpp)
-    - [longest increasing subsequence](/algorithms/dynamic-programming/digits/longest-increasing-subsequence.cpp)
     - [sum digits divisible by d](/algorithms/dynamic-programming/digits/sum-digits-divisible-by-d.cpp)
+    - [product of digits less equal than k](/algorithms/dynamic-programming/digits/product-of-digits-less-equal-than-k.cpp)
+    - [no 13 and 4 as substr](/algorithms/dynamic-programming/digits/no-13-and-4-as-substr.cpp)
     - [number divisible by sum of digits](/algorithms/dynamic-programming/digits/number-divisible-by-sum-of-digits.cpp)
+    - [longest increasing subsequence](/algorithms/dynamic-programming/digits/longest-increasing-subsequence.cpp)
 
 - [binary knapsack (bottom up)](/algorithms/dynamic-programming/binary-knapsack-(bottom-up).cpp)
 - [binary knapsack (top down)](/algorithms/dynamic-programming/binary-knapsack-(top-down).cpp)
@@ -110,10 +110,10 @@ You can find a little explanation about each algorithm at the [PDF Notebook](not
 
 #### Graphs
 - Flow Problems
-    - [maximum flow (edmonds karp)](/algorithms/graphs/Flow%20Problems/maximum-flow-(edmonds-karp).cpp)
     - [maximum flow (dinic)](/algorithms/graphs/Flow%20Problems/maximum-flow-(dinic).cpp)
-    - [minimum cost flow](/algorithms/graphs/Flow%20Problems/minimum-cost-flow.cpp)
     - [minimum cut (unweighted)](/algorithms/graphs/Flow%20Problems/minimum-cut-(unweighted).cpp)
+    - [maximum flow (edmonds karp)](/algorithms/graphs/Flow%20Problems/maximum-flow-(edmonds-karp).cpp)
+    - [minimum cost flow](/algorithms/graphs/Flow%20Problems/minimum-cost-flow.cpp)
 
 - [2 SAT](/algorithms/graphs/2-SAT.cpp)
 - [Cycle Distances](/algorithms/graphs/Cycle-Distances.cpp)
@@ -176,6 +176,7 @@ You can find a little explanation about each algorithm at the [PDF Notebook](not
 - [find multiplicative inverse](/algorithms/math/find-multiplicative-inverse.cpp)
 - [find solution diophantine equation](/algorithms/math/find-solution-diophantine-equation.cpp)
 - [gauss elimination](/algorithms/math/gauss-elimination.cpp)
+- [gauss xor](/algorithms/math/gauss-xor.cpp)
 - [integer mod](/algorithms/math/integer_mod.cpp)
 - [integer partition](/algorithms/math/integer-partition.cpp)
 - [linear recurrence](/algorithms/math/linear-recurrence.cpp)