diff --git a/d4/d8d/jarvis__algorithm_8cpp.html b/d4/d8d/jarvis__algorithm_8cpp.html
index 13256bb1f..4a3aa64d5 100644
--- a/d4/d8d/jarvis__algorithm_8cpp.html
+++ b/d4/d8d/jarvis__algorithm_8cpp.html
@@ -137,7 +137,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm. </p>
 <p>Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.</p>
-<h3><a class="anchor" id="autotoc_md39"></a>
+<h3><a class="anchor" id="autotoc_md42"></a>
 Algorithm</h3>
 <p>The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.</p>
 <p>The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.</p>
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index a9b89e746..bc9db1ead 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
 <div class="title">List of all files </div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><h1><a class="anchor" id="autotoc_md18"></a>
+<div class="textblock"><h1><a class="anchor" id="autotoc_md21"></a>
 Backtracking</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/graph_coloring.cpp">Graph Coloring</a></li>
@@ -106,7 +106,7 @@ Backtracking</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/rat_maze.cpp">Rat Maze</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/sudoku_solve.cpp">Sudoku Solve</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md19"></a>
+<h1><a class="anchor" id="autotoc_md22"></a>
 Ciphers</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/caesar_cipher.cpp">Caesar Cipher</a></li>
@@ -114,7 +114,7 @@ Ciphers</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/vigenere_cipher.cpp">Vigenere Cipher</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/xor_cipher.cpp">Xor Cipher</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md20"></a>
+<h1><a class="anchor" id="autotoc_md23"></a>
 Data Structures</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/avltree.cpp">Avltree</a></li>
@@ -150,7 +150,7 @@ Data Structures</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_modern.cpp">Trie Modern</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_tree.cpp">Trie Tree</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md21"></a>
+<h1><a class="anchor" id="autotoc_md24"></a>
 Dynamic Programming</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/0_1_knapsack.cpp">0 1 Knapsack</a></li>
@@ -174,13 +174,13 @@ Dynamic Programming</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/shortest_common_supersequence.cpp">Shortest Common Supersequence</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/tree_height.cpp">Tree Height</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md22"></a>
+<h1><a class="anchor" id="autotoc_md25"></a>
 Geometry</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/jarvis_algorithm.cpp">Jarvis Algorithm</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/line_segment_intersection.cpp">Line Segment Intersection</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md23"></a>
+<h1><a class="anchor" id="autotoc_md26"></a>
 Graph</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/breadth_first_search.cpp">Breadth First Search</a></li>
@@ -201,12 +201,12 @@ Graph</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort.cpp">Topological Sort</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort_by_kahns_algo.cpp">Topological Sort By Kahns Algo</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md24"></a>
+<h1><a class="anchor" id="autotoc_md27"></a>
 Graphics</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graphics/spirograph.cpp">Spirograph</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md25"></a>
+<h1><a class="anchor" id="autotoc_md28"></a>
 Greedy Algorithms</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/dijkstra.cpp">Dijkstra</a></li>
@@ -215,7 +215,7 @@ Greedy Algorithms</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/kruskals_minimum_spanning_tree.cpp">Kruskals Minimum Spanning Tree</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/prims_minimum_spanning_tree.cpp">Prims Minimum Spanning Tree</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md26"></a>
+<h1><a class="anchor" id="autotoc_md29"></a>
 Hashing</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/chaining.cpp">Chaining</a></li>
@@ -223,7 +223,7 @@ Hashing</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/linear_probing_hash_table.cpp">Linear Probing Hash Table</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/quadratic_probing_hash_table.cpp">Quadratic Probing Hash Table</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md27"></a>
+<h1><a class="anchor" id="autotoc_md30"></a>
 Machine Learning</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/adaline_learning.cpp">Adaline Learning</a></li>
@@ -233,7 +233,7 @@ Machine Learning</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/ordinary_least_squares_regressor.cpp">Ordinary Least Squares Regressor</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/vector_ops.hpp">Vector Ops</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md28"></a>
+<h1><a class="anchor" id="autotoc_md31"></a>
 Math</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/armstrong_number.cpp">Armstrong Number</a></li>
@@ -268,7 +268,7 @@ Math</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/string_fibonacci.cpp">String Fibonacci</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/sum_of_digits.cpp">Sum Of Digits</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md29"></a>
+<h1><a class="anchor" id="autotoc_md32"></a>
 Numerical Methods</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/bisection_method.cpp">Bisection Method</a></li>
@@ -288,7 +288,7 @@ Numerical Methods</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/qr_eigen_values.cpp">Qr Eigen Values</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/successive_approximation.cpp">Successive Approximation</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md30"></a>
+<h1><a class="anchor" id="autotoc_md33"></a>
 Operations On Datastructures</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/array_left_rotation.cpp">Array Left Rotation</a></li>
@@ -301,7 +301,7 @@ Operations On Datastructures</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/selectionsortlinkedlist.cpp">Selectionsortlinkedlist</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/union_of_2_arrays.cpp">Union Of 2 Arrays</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md31"></a>
+<h1><a class="anchor" id="autotoc_md34"></a>
 Others</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/buzz_number.cpp">Buzz Number</a></li>
@@ -322,7 +322,7 @@ Others</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/tower_of_hanoi.cpp">Tower Of Hanoi</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/vector_important_functions.cpp">Vector Important Functions</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md32"></a>
+<h1><a class="anchor" id="autotoc_md35"></a>
 Probability</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/addition_rule.cpp">Addition Rule</a></li>
@@ -330,7 +330,7 @@ Probability</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/binomial_dist.cpp">Binomial Dist</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/poisson_dist.cpp">Poisson Dist</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md33"></a>
+<h1><a class="anchor" id="autotoc_md36"></a>
 Range Queries</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/fenwick_tree.cpp">Fenwick Tree</a></li>
@@ -338,7 +338,7 @@ Range Queries</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/mo.cpp">Mo</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/segtree.cpp">Segtree</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md34"></a>
+<h1><a class="anchor" id="autotoc_md37"></a>
 Search</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp">Binary Search</a></li>
@@ -353,7 +353,7 @@ Search</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/ternary_search.cpp">Ternary Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/text_search.cpp">Text Search</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md35"></a>
+<h1><a class="anchor" id="autotoc_md38"></a>
 Sorting</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bead_sort.cpp">Bead Sort</a></li>
@@ -384,7 +384,7 @@ Sorting</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/swap_sort.cpp">Swap Sort</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/tim_sort.cpp">Tim Sort</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md36"></a>
+<h1><a class="anchor" id="autotoc_md39"></a>
 Strings</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/strings/brute_force_string_searching.cpp">Brute Force String Searching</a></li>
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index c4fcc36b5..d5db08c77 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
 <p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
-<h3><a class="anchor" id="autotoc_md44"></a>
+<h3><a class="anchor" id="autotoc_md47"></a>
 Algorithm</h3>
 <p>Shuffle the array untill array is sorted.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>
diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
index 1c56c71b9..4c6694408 100644
--- a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
+++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
@@ -254,18 +254,26 @@ Pull Requests</h2>
 <li>Checkout our <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/.github/pull_request_template.md">pull request template</a></li>
 </ul>
 <h3><a class="anchor" id="autotoc_md16"></a>
-cpplint</h3>
-<p>To see if <a href="https://github.com/cpplint/cpplint"><b>cpplint</b></a> is already installed, do:</p><ul>
-<li><code>cpplint --version</code> # currently returns "cpplint 1.4.4" If cpplint is ___not___ installed then do:</li>
-<li><code>python3 -m pip install cpplint</code> # If that does not work then try...</li>
-<li><code>py -m pip install cpplint</code> # If that does not work then try...</li>
-<li><code>pip install cpplint</code> Once cpplint is installed, test your file(s) with:</li>
-<li><code>cpplint --filter=-legal my_file.cpp my_other_file.cpp</code> # Fix any issues and try again.</li>
+Building Locally</h3>
+<p>Before submitting a pull request, build the code locally or using the convenient <a href="https://gitpod.io/#https://github.com/TheAlgorithms/C-Plus-Plus"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> service. </p><div class="fragment"><div class="line">cmake -B build -S .</div>
+</div><!-- fragment --><h3><a class="anchor" id="autotoc_md17"></a>
+Static Code Analyzer</h3>
+<p>We use <a href="https://clang.llvm.org/extra/clang-tidy/">clang-tidy</a> as a static code analyzer with a configuration in <a href="../../.clang-tidy">.clang-tidy</a>. </p><div class="fragment"><div class="line">clang-tidy --fix --quiet -p build subfolder/file_to_check.cpp --</div>
+</div><!-- fragment --><h3><a class="anchor" id="autotoc_md18"></a>
+Code Formatter</h3>
+<p><a href="https://clang.llvm.org/docs/ClangFormat.html"><b>clang-format</b></a> is used for code forrmating.</p><ul>
+<li>Installation (Only needs to be installed once.)<ul>
+<li>Mac (using home-brew): <code>brew install clang-format</code></li>
+<li>Mac (using macports): <code>sudo port install clang-10 +analyzer</code></li>
+<li>Windows (MSYS2 64-bit): <code>pacman -S mingw-w64-x86_64-clang-tools-extra</code></li>
+<li>Linux (Debian): <code>sudo apt-get install clang-format-10 clang-tidy-10</code></li>
 </ul>
-<p>The <a href="https://clang.llvm.org/docs/ClangFormat.html"><b>clang-format</b></a> tool can fix whitespace related <em>cpplint</em> issues.</p><ul>
-<li>On Macs only: <code>brew install clang-format</code> # Only needs to be installed once.</li>
-<li>All platforms: <code>clang-format -i -style="{IndentWidth: 4}" my_file.cpp</code></li>
+</li>
+<li>Running (all platforms): <code>clang-format -i -style="file" my_file.cpp</code></li>
 </ul>
+<h3><a class="anchor" id="autotoc_md19"></a>
+GitHub Actions</h3>
+<p>Enable GitHub Actions on your fork of the repository. After enabling it will execute <code>clang-tidy</code> and <code>clang-format</code> after every a push (not a commit). The result can create another commit if the actions made any changes on your behalf. Hence, it is better to wait and check the results of GitHub Actions after every push. Run <code>git pull</code> in your local clone if these actions made many changes in order to avoid merge conflicts.</p>
 <p>Most importantly,</p><ul>
 <li>Happy coding! </li>
 </ul>
diff --git a/index.html b/index.html
index 48612122b..7b0eef9b5 100644
--- a/index.html
+++ b/index.html
@@ -96,10 +96,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
 <div class="contents">
 <div class="textblock"><p><a class="anchor" id="mainpage"></a></p>
 <p><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C-Plus-Plus"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://lgtm.com/projects/g/TheAlgorithms/C-Plus-Plus/context:cpp"><img src="https://img.shields.io/lgtm/grade/cpp/g/TheAlgorithms/C-Plus-Plus.svg?logo=lgtm&amp;logoWidth=18" alt="Language grade: C/C++" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&amp;logo=gitter&amp;style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md"><img src="https://img.shields.io/static/v1.svg?label=Contributions&amp;message=Welcome&amp;color=0059b3&amp;style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C-Plus-Plus?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C-Plus-Plus"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions?query=workflow%3A%22Awesome+CI+Workflow%22"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a></p>
-<h1><a class="anchor" id="autotoc_md40"></a>
+<h1><a class="anchor" id="autotoc_md43"></a>
 Overview</h1>
 <p>The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/LICENSE">MIT License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.</p>
-<h1><a class="anchor" id="autotoc_md41"></a>
+<h1><a class="anchor" id="autotoc_md44"></a>
 Features</h1>
 <ul>
 <li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C%2B%2B">C++</a>.</li>
@@ -110,12 +110,12 @@ Features</h1>
 <li>Self-checks within programs ensure correct implementations with confidence.</li>
 <li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li>
 </ul>
-<h1><a class="anchor" id="autotoc_md42"></a>
+<h1><a class="anchor" id="autotoc_md45"></a>
 Documentation</h1>
 <p><a href="https://TheAlgorithms.github.io/C-Plus-Plus">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on <a href="https://TheAlgorithms.github.io/C-Plus-Plus/files.html">Files menu</a> to see the list of all the files documented with the code.</p>
 <p><a href="https://thealgorithms.github.io/C-Plus-Plus">Documentation of Algorithms in C++</a> by <a href="https://github.com/TheAlgorithms/C-Plus-Plus/graphs/contributors">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1">CC BY-SA 4.0</a><br  />
  <a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p>
-<h1><a class="anchor" id="autotoc_md43"></a>
+<h1><a class="anchor" id="autotoc_md46"></a>
 Contributions</h1>
 <p>As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md">Contribution Guidelines</a>. </p>
 </div></div><!-- PageDoc -->
diff --git a/navtreedata.js b/navtreedata.js
index d72f847da..186117e05 100644
--- a/navtreedata.js
+++ b/navtreedata.js
@@ -26,10 +26,10 @@ var NAVTREE =
 [
   [ "Algorithms_in_C++", "index.html", [
     [ "The Algorithms - C++", "index.html", [
-      [ "Overview", "index.html#autotoc_md40", null ],
-      [ "Features", "index.html#autotoc_md41", null ],
-      [ "Documentation", "index.html#autotoc_md42", null ],
-      [ "Contributions", "index.html#autotoc_md43", null ]
+      [ "Overview", "index.html#autotoc_md43", null ],
+      [ "Features", "index.html#autotoc_md44", null ],
+      [ "Documentation", "index.html#autotoc_md45", null ],
+      [ "Contributions", "index.html#autotoc_md46", null ]
     ] ],
     [ "CONTRIBUTION GUIDELINES", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html", [
       [ "Before contributing", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md4", null ],
@@ -45,30 +45,33 @@ var NAVTREE =
           [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md14", null ]
         ] ],
         [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md15", [
-          [ "cpplint", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md16", null ]
+          [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md16", null ],
+          [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md17", null ],
+          [ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md18", null ],
+          [ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md19", null ]
         ] ]
       ] ]
     ] ],
     [ "List of all files", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [
-      [ "Backtracking", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md18", null ],
-      [ "Ciphers", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md19", null ],
-      [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md20", null ],
-      [ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md21", null ],
-      [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md22", null ],
-      [ "Graph", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md23", null ],
-      [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md24", null ],
-      [ "Greedy Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md25", null ],
-      [ "Hashing", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md26", null ],
-      [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27", null ],
-      [ "Math", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md28", null ],
-      [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md29", null ],
-      [ "Operations On Datastructures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md30", null ],
-      [ "Others", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md31", null ],
-      [ "Probability", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md32", null ],
-      [ "Range Queries", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md33", null ],
-      [ "Search", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md34", null ],
-      [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md35", null ],
-      [ "Strings", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md36", null ]
+      [ "Backtracking", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md21", null ],
+      [ "Ciphers", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md22", null ],
+      [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md23", null ],
+      [ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md24", null ],
+      [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md25", null ],
+      [ "Graph", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md26", null ],
+      [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27", null ],
+      [ "Greedy Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md28", null ],
+      [ "Hashing", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md29", null ],
+      [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md30", null ],
+      [ "Math", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md31", null ],
+      [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md32", null ],
+      [ "Operations On Datastructures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md33", null ],
+      [ "Others", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md34", null ],
+      [ "Probability", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md35", null ],
+      [ "Range Queries", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md36", null ],
+      [ "Search", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md37", null ],
+      [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md38", null ],
+      [ "Strings", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md39", null ]
     ] ],
     [ "Prime factorization", "d7/d7f/section.html", null ],
     [ "Todo List", "dd/da0/todo.html", null ],
@@ -111,9 +114,9 @@ var NAVTREEINDEX =
 "annotated.html",
 "d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda",
 "d5/df6/check__amicable__pair_8cpp.html",
-"d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d",
-"da/df2/durand__kerner__roots_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627",
-"dd/d91/class_fenwick_tree.html#aaddab1f03d4941212a82cc647b1adb17"
+"d8/d95/vector__ops_8hpp.html",
+"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0",
+"dd/d91/class_fenwick_tree.html#a70f8c261393ca09ec1ad716ac806ead6"
 ];
 
 var SYNCONMSG = 'click to disable panel synchronisation';
diff --git a/navtreeindex1.js b/navtreeindex1.js
index 7d5782f32..428721119 100644
--- a/navtreeindex1.js
+++ b/navtreeindex1.js
@@ -178,13 +178,13 @@ var NAVTREEINDEX1 =
 "d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[8,0,15,6,3],
 "d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[8,0,15,4,1],
 "d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[5,3,1],
-"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[8,0,15,6,1],
 "d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[5,3,3],
-"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[8,0,15,6,2],
+"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[8,0,15,6,1],
 "d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[5,3,4],
+"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[8,0,15,6,2],
 "d5/d4c/group__sorting.html#gabd9a93f241c5c86f2ec0abf8b66b4145":[8,0,15,4,0],
-"d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,6,0],
 "d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[5,3,2],
+"d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,6,0],
 "d5/d5f/namespacegeometry.html":[7,0,3],
 "d5/d5f/namespacegeometry.html":[6,0,7],
 "d5/d67/bayes__theorem_8cpp.html":[8,0,12,1],
@@ -198,25 +198,25 @@ var NAVTREEINDEX1 =
 "d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,9,4,2],
 "d5/d67/complex__numbers_8cpp.html#af738b2a6921f0a6868bb7c5b4c0d18e0":[8,0,9,4,3],
 "d5/d88/md__d_i_r_e_c_t_o_r_y.html":[2],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md18":[2,0],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md19":[2,1],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md20":[2,2],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md21":[2,3],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md22":[2,4],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md23":[2,5],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md24":[2,6],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md25":[2,7],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md26":[2,8],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27":[2,9],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md28":[2,10],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md29":[2,11],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md30":[2,12],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md31":[2,13],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md32":[2,14],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md33":[2,15],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md34":[2,16],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md35":[2,17],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md36":[2,18],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md21":[2,0],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md22":[2,1],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md23":[2,2],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md24":[2,3],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md25":[2,4],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md26":[2,5],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27":[2,6],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md28":[2,7],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md29":[2,8],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md30":[2,9],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md31":[2,10],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md32":[2,11],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md33":[2,12],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md34":[2,13],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md35":[2,14],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md36":[2,15],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md37":[2,16],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md38":[2,17],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md39":[2,18],
 "d5/d91/namespacesorting.html":[6,0,24],
 "d5/da1/structnode.html":[7,0,27],
 "d5/da1/structnode.html#a063635bc4e984d971d1efeb4230b0515":[7,0,27,5],
diff --git a/navtreeindex2.js b/navtreeindex2.js
index b484a4722..6eb45e346 100644
--- a/navtreeindex2.js
+++ b/navtreeindex2.js
@@ -118,6 +118,9 @@ var NAVTREEINDEX2 =
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md14":[1,1,1,6],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md15":[1,1,2],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md16":[1,1,2,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md17":[1,1,2,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md18":[1,1,2,2],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md19":[1,1,2,3],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md4":[1,0],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md5":[1,1],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md6":[1,1,0],
@@ -246,8 +249,5 @@ var NAVTREEINDEX2 =
 "d8/d8a/exponential__search_8cpp.html":[8,0,14,1],
 "d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7":[8,0,14,1,0],
 "d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d":[8,0,14,1,2],
-"d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,14,1,1],
-"d8/d95/vector__ops_8hpp.html":[8,0,8,5],
-"d8/d95/vector__ops_8hpp.html#a05b9445c6ab65053b9bf9897a96af82d":[8,0,8,5,6],
-"d8/d95/vector__ops_8hpp.html#a1b42d24ad7bedbfa8e5b59fe96987a44":[8,0,8,5,1]
+"d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,14,1,1]
 };
diff --git a/navtreeindex3.js b/navtreeindex3.js
index bed51a4f4..9e9c127eb 100644
--- a/navtreeindex3.js
+++ b/navtreeindex3.js
@@ -1,5 +1,8 @@
 var NAVTREEINDEX3 =
 {
+"d8/d95/vector__ops_8hpp.html":[8,0,8,5],
+"d8/d95/vector__ops_8hpp.html#a05b9445c6ab65053b9bf9897a96af82d":[8,0,8,5,6],
+"d8/d95/vector__ops_8hpp.html#a1b42d24ad7bedbfa8e5b59fe96987a44":[8,0,8,5,1],
 "d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d":[8,0,8,5,11],
 "d8/d95/vector__ops_8hpp.html#a2a282c162e12f193c58232f26f0fa62d":[8,0,8,5,12],
 "d8/d95/vector__ops_8hpp.html#a4d136cbf20e3126ed9b934ab2d03f18b":[8,0,8,5,21],
@@ -116,13 +119,13 @@ var NAVTREEINDEX3 =
 "d9/d66/group__machine__learning.html#ga525335710b53cb064ca56b936120431e":[8,0,8,2,0],
 "d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336":[5,1,6],
 "d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336":[8,0,8,1,6],
-"d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa":[5,1,7],
 "d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa":[8,0,8,2,5],
+"d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa":[5,1,7],
 "d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f":[5,1,5],
 "d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f":[8,0,8,1,3],
 "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[5,1,4],
-"d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,0,8,1,1],
 "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,0,8,2,1],
+"d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,0,8,1,1],
 "d9/d69/median__search_8cpp.html":[8,0,14,8],
 "d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae":[8,0,14,8,1],
 "d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[8,0,14,8,2],
@@ -205,9 +208,9 @@ var NAVTREEINDEX3 =
 "da/d9a/class_graph.html#a6afcd41564ea00294a4c089414979ca1":[7,0,18,39],
 "da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d":[7,0,18,19],
 "da/d9a/class_graph.html#a6d95f41d2df61697379ccc209c78f801":[7,0,18,24],
-"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,18,12],
-"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,18,13],
 "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,18,14],
+"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,18,13],
+"da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4":[7,0,18,12],
 "da/d9a/class_graph.html#a73268574e2528b8e760191113ef6d1eb":[7,0,18,26],
 "da/d9a/class_graph.html#a8a34b80e2f3749992e0e9b83de742fba":[7,0,18,25],
 "da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[7,0,18,8],
@@ -246,8 +249,5 @@ var NAVTREEINDEX3 =
 "da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[8,0,11,2,0],
 "da/df2/durand__kerner__roots_8cpp.html":[8,0,10,2],
 "da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[8,0,10,2,2],
-"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,10,2,8],
-"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,10,2,7],
-"da/df2/durand__kerner__roots_8cpp.html#a212979f5fc9dcf0a420e90b9b21d780a":[8,0,10,2,1],
-"da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740":[8,0,10,2,3]
+"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,10,2,8]
 };
diff --git a/navtreeindex4.js b/navtreeindex4.js
index 6ee06dac3..057e6ef52 100644
--- a/navtreeindex4.js
+++ b/navtreeindex4.js
@@ -1,5 +1,8 @@
 var NAVTREEINDEX4 =
 {
+"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,10,2,7],
+"da/df2/durand__kerner__roots_8cpp.html#a212979f5fc9dcf0a420e90b9b21d780a":[8,0,10,2,1],
+"da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740":[8,0,10,2,3],
 "da/df2/durand__kerner__roots_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[8,0,10,2,5],
 "da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153":[8,0,10,2,6],
 "da/df2/durand__kerner__roots_8cpp.html#ac38b9cfd2a39d856e0feba3b5d241ded":[8,0,10,2,4],
@@ -246,8 +249,5 @@ var NAVTREEINDEX4 =
 "dd/d91/class_fenwick_tree.html":[7,0,17],
 "dd/d91/class_fenwick_tree.html#a115ff5c548b429b737ea09f75817d1f9":[7,0,17,4],
 "dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00":[7,0,17,5],
-"dd/d91/class_fenwick_tree.html#a4816596da965b5f0871d77b5a1985aa1":[7,0,17,7],
-"dd/d91/class_fenwick_tree.html#a70f8c261393ca09ec1ad716ac806ead6":[7,0,17,1],
-"dd/d91/class_fenwick_tree.html#aa8ecebf6f4ad9faaf4b826668d9409bb":[7,0,17,6],
-"dd/d91/class_fenwick_tree.html#aaae15ea71455315e257baa11017cec10":[7,0,17,2]
+"dd/d91/class_fenwick_tree.html#a4816596da965b5f0871d77b5a1985aa1":[7,0,17,7]
 };
diff --git a/navtreeindex5.js b/navtreeindex5.js
index 4fce6f5a2..d8ccbe324 100644
--- a/navtreeindex5.js
+++ b/navtreeindex5.js
@@ -1,5 +1,8 @@
 var NAVTREEINDEX5 =
 {
+"dd/d91/class_fenwick_tree.html#a70f8c261393ca09ec1ad716ac806ead6":[7,0,17,1],
+"dd/d91/class_fenwick_tree.html#aa8ecebf6f4ad9faaf4b826668d9409bb":[7,0,17,6],
+"dd/d91/class_fenwick_tree.html#aaae15ea71455315e257baa11017cec10":[7,0,17,2],
 "dd/d91/class_fenwick_tree.html#aaddab1f03d4941212a82cc647b1adb17":[7,0,17,0],
 "dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699":[7,0,17,3],
 "dd/da0/todo.html":[4],
@@ -134,8 +137,8 @@ var NAVTREEINDEX5 =
 "dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[8,0,7],
 "dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[8,0,2,0],
 "files.html":[8,0],
-"functions.html":[7,3,0,0],
 "functions.html":[7,3,0],
+"functions.html":[7,3,0,0],
 "functions_a.html":[7,3,0,1],
 "functions_b.html":[7,3,0,2],
 "functions_c.html":[7,3,0,3],
@@ -215,19 +218,19 @@ var NAVTREEINDEX5 =
 "hierarchy.html":[7,2],
 "index.html":[],
 "index.html":[0],
-"index.html#autotoc_md40":[0,0],
-"index.html#autotoc_md41":[0,1],
-"index.html#autotoc_md42":[0,2],
-"index.html#autotoc_md43":[0,3],
+"index.html#autotoc_md43":[0,0],
+"index.html#autotoc_md44":[0,1],
+"index.html#autotoc_md45":[0,2],
+"index.html#autotoc_md46":[0,3],
 "modules.html":[5],
 "namespacemembers.html":[6,1,0],
 "namespacemembers_func.html":[6,1,1],
 "namespacemembers_vars.html":[6,1,2],
 "namespaces.html":[6,0],
 "pages.html":[],
-"":[7,0,6,0],
 "":[7,0,3,0],
+"":[7,0,6,0],
 "":[7,0,6,0,0],
-"":[7,0,8,0],
-"":[7,0,4,0]
+"":[7,0,4,0],
+"":[7,0,8,0]
 };