Documentation for d07ab7d0f1

2023-04-27 16:41:35 +00:00 · 2023-04-27 16:41:35 +00:00 · f18af03008
parent 507649499a
commit f18af03008
16 changed files with 239 additions and 137 deletions
--- a/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html
+++ b/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html
@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d1/d12/md_data_structures_stack__r_e_a
 </div><!--header-->
 <div class="contents">
 <div class="textblock"><p>This is a modular generic stack data-structure. The stack is self growing.</p>
-<h2><a class="anchor" id="autotoc_md44"></a>
+<h2><a class="anchor" id="autotoc_md45"></a>
 Content</h2>
 <ul>
 <li>stack-Header file for import.</li>
@ -110,7 +110,7 @@ Content</h2>
 <li>stack_linkedlist: Another stack implementation by linkedlist</li>
 </ul>
 <p>You need to only import the <b>stack.h</b></p>
-<h2><a class="anchor" id="autotoc_md45"></a>
+<h2><a class="anchor" id="autotoc_md46"></a>
 Public interface</h2>
 <div class="fragment"><div class="line"><span class="keywordtype">void</span> initStack();</div>
 </div><!-- fragment --><p>Initializes the stack with a capacity of 10 elements.</p>
--- 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
@ -103,12 +103,13 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
 <div class="textblock"><ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c" target="_blank">Alaw</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md47"></a>
+<h1><a class="anchor" id="autotoc_md48"></a>
 Cipher</h1>
 <ul>
+<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/cipher/affine.c" target="_blank">Affine</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/cipher/rot13.c" target="_blank">Rot13</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md48"></a>
+<h1><a class="anchor" id="autotoc_md49"></a>
 Client Server</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/client.c" target="_blank">Client</a></li>
@ -122,7 +123,7 @@ Client Server</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_client.c" target="_blank">Udp Client</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_server.c" target="_blank">Udp Server</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md49"></a>
+<h1><a class="anchor" id="autotoc_md50"></a>
 Conversions</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_decimal.c" target="_blank">Binary To Decimal</a></li>
@ -147,7 +148,7 @@ Conversions</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/roman_numerals_to_decimal.c" target="_blank">Roman Numerals To Decimal</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/conversions/to_decimal.c" target="_blank">To Decimal</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md50"></a>
+<h1><a class="anchor" id="autotoc_md51"></a>
 Data Structures</h1>
 <ul>
 <li>Array<ul>
@ -253,7 +254,7 @@ Data Structures</h1>
 </li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/vector.c" target="_blank">Vector</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md51"></a>
+<h1><a class="anchor" id="autotoc_md52"></a>
 Developer Tools</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.c" target="_blank">Malloc Dbg</a></li>
@ -262,13 +263,13 @@ Developer Tools</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_malloc_dbg.c" target="_blank">Test Malloc Dbg</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_min_printf.c" target="_blank">Test Min Printf</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md52"></a>
+<h1><a class="anchor" id="autotoc_md53"></a>
 Dynamic Programming</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/lcs.c" target="_blank">Lcs</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/matrix_chain_order.c" target="_blank">Matrix Chain Order</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md53"></a>
+<h1><a class="anchor" id="autotoc_md54"></a>
 Exercism</h1>
 <ul>
 <li>Acronym<ul>
@ -297,31 +298,31 @@ Exercism</h1>
 </ul>
 </li>
 </ul>
-<h1><a class="anchor" id="autotoc_md54"></a>
+<h1><a class="anchor" id="autotoc_md55"></a>
 Games</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/games/naval_battle.c" target="_blank">Naval Battle</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/games/tic_tac_toe.c" target="_blank">Tic Tac Toe</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md55"></a>
+<h1><a class="anchor" id="autotoc_md56"></a>
 Geometry</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/geometry_datatypes.h" target="_blank">Geometry Datatypes</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/quaternions.c" target="_blank">Quaternions</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/geometry/vectors_3d.c" target="_blank">Vectors 3D</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md56"></a>
+<h1><a class="anchor" id="autotoc_md57"></a>
 Graphics</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c" target="_blank">Spirograph</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md57"></a>
+<h1><a class="anchor" id="autotoc_md58"></a>
 Greedy Approach</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/dijkstra.c" target="_blank">Dijkstra</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/prim.c" target="_blank">Prim</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md58"></a>
+<h1><a class="anchor" id="autotoc_md59"></a>
 Hash</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c" target="_blank">Hash Adler32</a></li>
@ -331,7 +332,7 @@ Hash</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_sdbm.c" target="_blank">Hash Sdbm</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_xor8.c" target="_blank">Hash Xor8</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md59"></a>
+<h1><a class="anchor" id="autotoc_md60"></a>
 Machine Learning</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/adaline_learning.c" target="_blank">Adaline Learning</a></li>
@ -339,7 +340,7 @@ Machine Learning</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_topology.c" target="_blank">Kohonen Som Topology</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_trace.c" target="_blank">Kohonen Som Trace</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md60"></a>
+<h1><a class="anchor" id="autotoc_md61"></a>
 Math</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/armstrong_number.c" target="_blank">Armstrong Number</a></li>
@ -347,6 +348,7 @@ Math</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/cartesian_to_polar.c" target="_blank">Cartesian To Polar</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/catalan.c" target="_blank">Catalan</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/collatz.c" target="_blank">Collatz</a></li>
+<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/euclidean_algorithm_extended.c" target="_blank">Euclidean Algorithm Extended</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/factorial.c" target="_blank">Factorial</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/factorial_large_number.c" target="_blank">Factorial Large Number</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/factorial_trailing_zeroes.c" target="_blank">Factorial Trailing Zeroes</a></li>
@ -365,7 +367,7 @@ Math</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/prime_sieve.c" target="_blank">Prime Sieve</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/strong_number.c" target="_blank">Strong Number</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md61"></a>
+<h1><a class="anchor" id="autotoc_md62"></a>
 Misc</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/demonetization.c" target="_blank">Demonetization</a></li>
@ -385,7 +387,7 @@ Misc</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/tower_of_hanoi.c" target="_blank">Tower Of Hanoi</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/union_find.c" target="_blank">Union Find</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md62"></a>
+<h1><a class="anchor" id="autotoc_md63"></a>
 Numerical Methods</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/bisection_method.c" target="_blank">Bisection Method</a></li>
@ -407,12 +409,12 @@ Numerical Methods</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/simpsons_1_3rd_rule.c" target="_blank">Simpsons 1 3Rd Rule</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/variance.c" target="_blank">Variance</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md63"></a>
+<h1><a class="anchor" id="autotoc_md64"></a>
 Process Scheduling Algorithms</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/process_scheduling_algorithms/non_preemptive_priority_scheduling.c" target="_blank">Non Preemptive Priority Scheduling</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md64"></a>
+<h1><a class="anchor" id="autotoc_md65"></a>
 Project Euler</h1>
 <ul>
 <li>Problem 1<ul>
@ -519,7 +521,7 @@ Project Euler</h1>
 </ul>
 </li>
 </ul>
-<h1><a class="anchor" id="autotoc_md65"></a>
+<h1><a class="anchor" id="autotoc_md66"></a>
 Searching</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c" target="_blank">Binary Search</a></li>
@ -540,7 +542,7 @@ Searching</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/sentinel_linear_search.c" target="_blank">Sentinel Linear Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/ternary_search.c" target="_blank">Ternary Search</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md66"></a>
+<h1><a class="anchor" id="autotoc_md67"></a>
 Sorting</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c" target="_blank">Bead Sort</a></li>
--- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
+++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.
  <div class="headertitle"><div class="title">LeetCode </div></div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><h2><a class="anchor" id="autotoc_md71"></a>
+<div class="textblock"><h2><a class="anchor" id="autotoc_md72"></a>
 LeetCode Algorithm</h2>
 <table class="markdownTable">
 <tr class="markdownTableHead">
--- 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
@ -155,8 +155,105 @@ For LeetCode solutions, please check its &lt;a href="<a href="https://github.com
 - Make sure to add examples and test cases in your &lt;tt&gt;main()&lt;/tt&gt; function.
 - If you find an algorithm or document without tests, please feel free to create a pull request or issue describing suggested changes.
 - Please try to add one or more &lt;tt&gt;test()&lt;/tt&gt; functions that will invoke the algorithm implementation on random test data with the expected output. Use the &lt;tt&gt;assert()&lt;/tt&gt; function to confirm that the tests will pass. Requires including the &lt;tt&gt;assert.h&lt;/tt&gt; library.
+- Test cases should fully verify that your program works as expected. Rather than asking the user for input, it's best to make sure the given output is the correct output.

-@subsubsection autotoc_md27 Typical structure of a program
+@paragraph autotoc_md27 Self-test examples
+
+1. &lt;a href="<a href="https://github.com/TheAlgorithms/C/blob/master/cipher/rot13.c">https://github.com/TheAlgorithms/C/blob/master/cipher/rot13.c</a>" target="_blank" &gt;ROT13 Cipher&lt;/a&gt; (complex).
+
+@icode{c} 
+    // NOTE: the `rot13` function is defined in another part of the code.
+
+    char test_01[] = "The more I C, the less I see.";
+    rot13(test_01);
+    assert(strcmp(test_01, "Gur zber V P, gur yrff V frr.") == 0);
+
+    char test_02[] = "Which witch switched the Swiss wristwatches?";
+    rot13(test_02);
+    assert(strcmp(test_02, "Juvpu jvgpu fjvgpurq gur Fjvff jevfgjngpurf?") == 0);
+
+    char test_03[] = "Juvpu jvgpu fjvgpurq gur Fjvff jevfgjngpurf?";
+    rot13(test_03);
+    assert(strcmp(test_03, "Which witch switched the Swiss wristwatches?") == 0);
+@endicode
+
+2. &lt;a href="<a href="https://github.com/TheAlgorithms/C/blob/master/misc/sudoku_solver.c">https://github.com/TheAlgorithms/C/blob/master/misc/sudoku_solver.c</a>" target="_blank" &gt;Sudoku Solver&lt;/a&gt; (medium).
+
+@icode{c} 
+    uint8_t test_array[] = {3, 0, 6, 5, 0, 8, 4, 0, 0, 5, 2, 0, 0, 0, 0, 0, 0,
+                            0, 0, 8, 7, 0, 0, 0, 0, 3, 1, 0, 0, 3, 0, 1, 0, 0,
+                            8, 0, 9, 0, 0, 8, 6, 3, 0, 0, 5, 0, 5, 0, 0, 9, 0,
+                            6, 0, 0, 1, 3, 0, 0, 0, 0, 2, 5, 0, 0, 0, 0, 0, 0,
+                            0, 0, 7, 4, 0, 0, 5, 2, 0, 6, 3, 0, 0};
+    struct sudoku a = {.N = 9, .N2 = 3, .a = test_array};
+    assert(solve(&amp;a));  // ensure that solution is obtained
+                        // NOTE: `solve` is defined in another part of the code.
+
+    uint8_t expected[] = {3, 1, 6, 5, 7, 8, 4, 9, 2, 5, 2, 9, 1, 3, 4, 7, 6,
+                          8, 4, 8, 7, 6, 2, 9, 5, 3, 1, 2, 6, 3, 4, 1, 5, 9,
+                          8, 7, 9, 7, 4, 8, 6, 3, 1, 2, 5, 8, 5, 1, 7, 9, 2,
+                          6, 4, 3, 1, 3, 8, 9, 4, 7, 2, 5, 6, 6, 9, 2, 3, 5,
+                          1, 8, 7, 4, 7, 4, 5, 2, 8, 6, 3, 1, 9};
+    for (int i = 0; i &lt; a.N; i++)
+        for (int j = 0; j &lt; a.N; j++)
+            assert(a.a[i * a.N + j] == expected[i * a.N + j]);
+@endicode
+
+3. Small C program that showcases and explains the use of tests.
+
+@icode{c} 
+#include &lt;stdio.h&gt;      /// for IO operations
+#include &lt;assert.h&gt;     /// for assert
+#include &lt;stdbool.h&gt;    /// for bool
+
+/**
+ * @brief Verifies if the given array
+ * contains the given number on it.
+ * @param arr the array to be used for checking
+ * @param number the number to check if it's inside the array
+ * @return false if the number was NOT found in the array
+ * @return true if the number WAS found in the array
+ */
+bool is_number_on_array(const int *arr, const int number) {
+    for (int i = 0; i &lt; sizeof(arr); i++) {
+        if (arr[i] == number) {
+            return true;
+        }
+        else {
+            // Number not in the current index, keep searching.
+        }
+    }
+
+    return false;
+}
+
+/**
+ * @brief Self-test implementations
+ * @returns void
+ */
+static void tests() {
+    int arr[] = { 9, 14, 21, 98, 67 };
+
+    assert(is_number_on_array(arr, 9) == true);
+    assert(is_number_on_array(arr, 4) == false);
+    assert(is_number_on_array(arr, 98) == true);
+    assert(is_number_on_array(arr, 512) == false);
+
+    printf("All tests have successfully passed!<br  />
+");
+}
+
+/**
+ * @brief Main function
+ * @returns 0 on exit
+ */
+int main() {
+    tests(); // run self-test implementations
+    return 0;
+}
+@endicode
+
+@subsubsection autotoc_md28 Typical structure of a program

@icode{c} 
 /**
@ -224,7 +321,7 @@ int main() {
 }
@endicode

-@subsubsection autotoc_md28 File name guidelines
+@subsubsection autotoc_md29 File name guidelines

 - Use lowercase words with &lt;tt&gt;"_"&lt;/tt&gt; as a separator
 - For instance
@ -238,7 +335,7 @@ my_new_c_struct.c    is correct format
 - File name validation will run on Docker to ensure validity.
 - If an implementation of the algorithm already exists and your version is different from that implemented, please use an incremental numeric digit as a suffix. For example: if &lt;tt&gt;median_search.c&lt;/tt&gt; already exists in the &lt;tt&gt;search&lt;/tt&gt; folder, and you are contributing a new implementation, the filename should be &lt;tt&gt;median_search2.c&lt;/tt&gt;. For a third implementation, &lt;tt&gt;median_search3.c&lt;/tt&gt;, and so on.

-@subsubsection autotoc_md29 Directory guidelines
+@subsubsection autotoc_md30 Directory guidelines

 - We recommend adding files to existing directories as much as possible.
 - Use lowercase words with &lt;tt&gt;"_"&lt;/tt&gt; as a separator ( no spaces or &lt;tt&gt;"-"&lt;/tt&gt; allowed )
@ -252,7 +349,7 @@ some_new_fancy_category         is correct
 - Filepaths will be used to dynamically create a directory of our algorithms.
 - Filepath validation will run on GitHub Actions to ensure compliance.

-@paragraph autotoc_md30 Integrating CMake in a new directory
+@paragraph autotoc_md31 Integrating CMake in a new directory

 In case a new directory is 100% required, &lt;tt&gt;CMakeLists.txt&lt;/tt&gt; file in the root directory needs to be updated, and a new &lt;tt&gt;CMakeLists.txt&lt;/tt&gt; file needs to be created within the new directory.

@ -288,7 +385,7 @@ add_subdirectory(numerical_methods)
 add_subdirectory(&lt;foldername&gt;)
@endicode

-@subsubsection autotoc_md31 Commit Guidelines
+@subsubsection autotoc_md32 Commit Guidelines

 - It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilled across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected.

@ -315,11 +412,11 @@ Common prefixes:
 - test: Correct existing tests or add new ones
 - chore: Miscellaneous changes that do not match any of the above.

-@subsection autotoc_md32 Pull Requests
+@subsection autotoc_md33 Pull Requests

 - Checkout our &lt;a href="<a href="https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md">https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md</a>" target="_blank" &gt;pull request template&lt;/a&gt;

-@subsubsection autotoc_md33 Building Locally
+@subsubsection autotoc_md34 Building Locally

 Before submitting a pull request, build the code locally or using the convenient &lt;a href="<a href="https://gitpod.io/#https://github.com/TheAlgorithms/C">https://gitpod.io/#https://github.com/TheAlgorithms/C</a>" target="_blank" &gt;&lt;img src="<a href="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod">https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod</a>" alt="Gitpod Ready-to-Code"/&gt;&lt;/a&gt; service.

@ -327,7 +424,7 @@ Before submitting a pull request, build the code locally or using the convenient
 cmake -B build -S .
@endicode

-@subsubsection autotoc_md34 Static Code Analyzer
+@subsubsection autotoc_md35 Static Code Analyzer

 We use &lt;a href="<a href="https://clang.llvm.org/extra/clang-tidy/">https://clang.llvm.org/extra/clang-tidy/</a>" target="_blank" &gt;&lt;tt&gt;clang-tidy&lt;/tt&gt;&lt;/a&gt; as a static code analyzer with a configuration in &lt;a href=".clang-tidy" target="_blank" &gt;&lt;tt&gt;.clang-tidy&lt;/tt&gt;&lt;/a&gt;.

@ -335,7 +432,7 @@ We use &lt;a href="<a href="https://clang.llvm.org/extra/clang-tidy/">https://cl
 clang-tidy --fix --quiet -p build subfolder/file_to_check.c --
@endicode

-@subsubsection autotoc_md35 Code Formatter
+@subsubsection autotoc_md36 Code Formatter

 &lt;a href="<a href="https://clang.llvm.org/docs/ClangFormat.html">https://clang.llvm.org/docs/ClangFormat.html</a>" target="_blank" &gt;**&lt;tt&gt;clang-format&lt;/tt&gt;**&lt;/a&gt; is used for code formatting.

@ -346,7 +443,7 @@ clang-tidy --fix --quiet -p build subfolder/file_to_check.c --
  - Linux (Debian): &lt;tt&gt;sudo apt-get install clang-format-10 clang-tidy-10&lt;/tt&gt;
 - Running (all platforms): &lt;tt&gt;clang-format -i -style="file" my_file.c&lt;/tt&gt;

-@subsubsection autotoc_md36 GitHub Actions
+@subsubsection autotoc_md37 GitHub Actions

 - Enable GitHub Actions on your fork of the repository.
 After enabling, it will execute &lt;tt&gt;clang-tidy&lt;/tt&gt; and &lt;tt&gt;clang-format&lt;/tt&gt; after every push (not a commit).
--- a/d7/db5/md_exercism__r_e_a_d_m_e.html
+++ b/d7/db5/md_exercism__r_e_a_d_m_e.html
@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d7/db5/md_exercism__r_e_a_d_m_e.html',
 </div><!--header-->
 <div class="contents">
 <div class="textblock"><p>This directory contains some sample solutions for <b>exercism.io</b></p>
-<h2><a class="anchor" id="autotoc_md68"></a>
+<h2><a class="anchor" id="autotoc_md69"></a>
 Overview</h2>
 <p>In this directory you will find (in the right order):</p><ul>
 <li>hello-world</li>
--- a/d9/d41/md_data_structures_array__r_e_a_d_m_e.html
+++ b/d9/d41/md_data_structures_array__r_e_a_d_m_e.html
@ -101,17 +101,17 @@ $(document).ready(function(){initNavTree('d9/d41/md_data_structures_array__r_e_a
 </div><!--header-->
 <div class="contents">
 <div class="textblock"><p>Simple array of integers. With I/O functions, Sort Functions and Search Functions.</p>
-<h1><a class="anchor" id="autotoc_md38"></a>
+<h1><a class="anchor" id="autotoc_md39"></a>
 Sort Function</h1>
 <p>The Sort function sorts the elements in the range in a particular order. The different types of sorting methods are Bubble Sort, Selection Sort, Merge Sort and Quick Sort. Bubble Sort repeatedly sorts the adjacent elements if they are in wrong order.</p>
-<h1><a class="anchor" id="autotoc_md39"></a>
+<h1><a class="anchor" id="autotoc_md40"></a>
 Structure</h1>
 <div class="fragment"><div class="line"><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d4/d2d/struct_c_array.html">CArray</a> {</div>
 <div class="line">        <span class="keywordtype">int</span> *array;</div>
 <div class="line">        <span class="keywordtype">int</span> size;</div>
 <div class="line">    } <a class="code hl_struct" href="../../d4/d2d/struct_c_array.html">CArray</a>;</div>
 <div class="ttc" id="astruct_c_array_html"><div class="ttname"><a href="../../d4/d2d/struct_c_array.html">CArray</a></div><div class="ttdef"><b>Definition:</b> carray.h:32</div></div>
-</div><!-- fragment --><h1><a class="anchor" id="autotoc_md40"></a>
+</div><!-- fragment --><h1><a class="anchor" id="autotoc_md41"></a>
 Files</h1>
 <ul>
 <li>CArray.c - Array Implementations</li>
--- a/da/d6c/exponential__search_8c.html
+++ b/da/d6c/exponential__search_8c.html
@ -183,7 +183,7 @@ Functions</h2></td></tr>
 <p>Function: binary_search.</p>
 <p>algorithm that search the index of the given item</p>
 <p>recursive function that search the given element in </p>
-<h2><a class="anchor" id="autotoc_md83"></a>
+<h2><a class="anchor" id="autotoc_md84"></a>
 the array using the &lt;a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Binary%20Search.md" target="_blank" &gt;Binary Search&lt;/a&gt;</h2>
 <dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
@ -253,7 +253,7 @@ Here is the call graph for this function:</div>
 <p>Function: exponential_search.</p>
 <p>algorithm that search the index of the given item</p>
 <p>recursive function that take an array and quickly find the range </p>
-<h2><a class="anchor" id="autotoc_md82"></a>
+<h2><a class="anchor" id="autotoc_md83"></a>
 where to apply the binary search algorithm to find the given element</h2>
 <dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
--- a/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html
+++ b/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html
@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('de/d20/md_data_structures_dictionary__
 <div class="textblock"><p>This is simple and generic dictionary. You can instantiate multiple dictionaries with the constructor. See interface below.</p>
 <p>Each dictionary has space for 1000 elements.</p>
 <p>You need add the files <b>dic.c</b> and <b>dic.h</b> in your project directory. After that you include dic.h</p>
-<h2><a class="anchor" id="autotoc_md42"></a>
+<h2><a class="anchor" id="autotoc_md43"></a>
 Overview about functions</h2>
 <div class="fragment"><div class="line">Dictionary * create_dict(void);</div>
 </div><!-- fragment --><p> create_dict: is a simple constructor for creating a dictionary and setting up the member field 'number_of_elements' and prepares the inner array 'elements'</p>
--- a/df/d58/md_leetcode__r_e_a_d_m_e.html
+++ b/df/d58/md_leetcode__r_e_a_d_m_e.html
@ -101,13 +101,13 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
 </div><!--header-->
 <div class="contents">
 <div class="textblock"><p>We're glad you're interested in adding C LeetCode solutions to the repository.\ Here we'll be explaining how to contribute to LeetCode solutions properly.</p>
-<h1><a class="anchor" id="autotoc_md73"></a>
+<h1><a class="anchor" id="autotoc_md74"></a>
 💻 Cloning/setting up the project 💻</h1>
 <p>First off, you'll need to fork the repository <a href="https://github.com/TheAlgorithms/C/fork" target="_blank"><b>here</b></a>.\ Then, you'll need to clone the repository to your local machine.</p>
 <div class="fragment"><div class="line">git clone https://github.com/your-username/C.git</div>
 </div><!-- fragment --><p>After that, you'll need to create a new branch for your solution.</p>
 <div class="fragment"><div class="line">git checkout -b solution/your-solution-name</div>
-</div><!-- fragment --><h1><a class="anchor" id="autotoc_md74"></a>
+</div><!-- fragment --><h1><a class="anchor" id="autotoc_md75"></a>
 📝 Adding a new solution 📝</h1>
 <p>All LeetCode problems can be found <a href="https://leetcode.com/problemset/all/" target="_blank"><b>here</b></a>.\ If you have a solution to any of these problems (which are not being <a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/DIRECTORY.md" target="_blank"><b>repeated</b></a>), that's great! Here are the steps:</p>
 <ol type="1">
@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
 <blockquote class="doxtable">
 <p>&zwj;<b>Note</b> There was a requirement to update the <code>leetcode/DIRECTORY.md</code> file with details of the solved problem. It's not required anymore. The information about the problem is fetched automatically throughout the LeetCode API. </p>
 </blockquote>
-<h1><a class="anchor" id="autotoc_md75"></a>
+<h1><a class="anchor" id="autotoc_md76"></a>
 📦 Committing your changes 📦</h1>
 <p>Once you're done with adding a new LeetCode solution, it's time we make a pull request.</p>
 <ol type="1">
--- a/index.html
+++ b/index.html
@ -102,10 +102,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" target="_blank"><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://github.com/TheAlgorithms/C/actions/workflows/codeql_analysis.yml" target="_blank"><img src="https://github.com/TheAlgorithms/C/actions/workflows/codeql.yml/badge.svg" alt="CodeQL CI" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms" target="_blank"><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/blob/master/CONTRIBUTING.md" target="_blank"><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?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C" target="_blank"><img src="https://github.com/TheAlgorithms/C/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C/actions?query=workflow%3A%22Awesome+CI+Workflow%22" target="_blank"><img src="https://github.com/TheAlgorithms/C/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms" target="_blank"><img src="https://img.shields.io/liberapay/receives/TheAlgorithms.svg?logo=liberapay" alt="Income" style="pointer-events: none;" class="inline"/></a> <a href="https://the-algorithms.com/discord/" target="_blank"><img src="https://img.shields.io/discord/808045925556682782.svg?logo=discord&amp;colorB=5865F2" alt="Discord chat" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms/donate" target="_blank"><img src="https://liberapay.com/assets/widgets/donate.svg" alt="Donate" style="pointer-events: none;" class="inline"/></a></p>
-<h1><a class="anchor" id="autotoc_md77"></a>
+<h1><a class="anchor" id="autotoc_md78"></a>
 Overview</h1>
 <p>The repository is a collection of open-source implementations of a variety of algorithms implemented in C and licensed under <a href="https://github.com/TheAlgorithms/C/blob/master/LICENSE" target="_blank">GPLv3 License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and their associated documentations 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 different algorithm strategies and optimizations.</p>
-<h1><a class="anchor" id="autotoc_md78"></a>
+<h1><a class="anchor" id="autotoc_md79"></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_(programming_language)" target="_blank">C</a>.</li>
@ -116,12 +116,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_md79"></a>
+<h1><a class="anchor" id="autotoc_md80"></a>
 Documentation</h1>
 <p><a href="https://TheAlgorithms.github.io/C" target="_blank">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. Click on <a href="https://TheAlgorithms.github.io/C/files.html" target="_blank">Files menu</a> to see the list of all the files documented with the code.</p>
 <p><a href="https://thealgorithms.github.io/C" target="_blank">Documentation of Algorithms in C</a> by <a href="https://github.com/TheAlgorithms/C/graphs/contributors" target="_blank">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1" target="_blank">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_md80"></a>
+<h1><a class="anchor" id="autotoc_md81"></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/blob/master/CONTRIBUTING.md" target="_blank">Contribution Guidelines</a>. </p>
 </div></div><!-- PageDoc -->
--- a/index.js
+++ b/index.js
@ -1,7 +1,7 @@
 var index =
 [
-    [ "Overview", "index.html#autotoc_md77", null ],
-    [ "Features", "index.html#autotoc_md78", null ],
-    [ "Documentation", "index.html#autotoc_md79", null ],
-    [ "Contributions", "index.html#autotoc_md80", null ]
+    [ "Overview", "index.html#autotoc_md78", null ],
+    [ "Features", "index.html#autotoc_md79", null ],
+    [ "Documentation", "index.html#autotoc_md80", null ],
+    [ "Contributions", "index.html#autotoc_md81", null ]
 ];
--- a/navtreedata.js
+++ b/navtreedata.js
@ -53,58 +53,60 @@ var NAVTREE =
        [ "Making Changes", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23", [
          [ "Code", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24", null ],
          [ "Documentation", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25", null ],
-          [ "Test", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26", null ],
-          [ "Typical structure of a program", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27", null ],
-          [ "File name guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28", null ],
-          [ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29", [
-            [ "Integrating CMake in a new directory", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", null ]
+          [ "Test", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26", [
+            [ "Self-test examples", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27", null ]
          ] ],
-          [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", null ]
+          [ "Typical structure of a program", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28", null ],
+          [ "File name guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29", null ],
+          [ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", [
+            [ "Integrating CMake in a new directory", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", null ]
+          ] ],
+          [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", null ]
        ] ],
-        [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", [
-          [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", null ],
-          [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ],
-          [ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ],
-          [ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36", null ]
+        [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", [
+          [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ],
+          [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ],
+          [ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36", null ],
+          [ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37", null ]
        ] ]
      ] ]
    ] ],
    [ "Array", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html", [
-      [ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38", null ],
-      [ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ],
-      [ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40", null ]
+      [ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ],
+      [ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40", null ],
+      [ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md41", null ]
    ] ],
    [ "Dictionary", "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html", null ],
    [ "Simple generic Stack", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html", null ],
    [ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [
-      [ "Cipher", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ],
-      [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
-      [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
-      [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
-      [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
-      [ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
-      [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
-      [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
-      [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
-      [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
-      [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
-      [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
-      [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
-      [ "Math", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
-      [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
-      [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ],
-      [ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ],
-      [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ],
-      [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65", null ],
-      [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66", null ]
+      [ "Cipher", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
+      [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
+      [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
+      [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
+      [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
+      [ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
+      [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
+      [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
+      [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
+      [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
+      [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
+      [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
+      [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
+      [ "Math", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
+      [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ],
+      [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ],
+      [ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ],
+      [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65", null ],
+      [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66", null ],
+      [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67", null ]
    ] ],
    [ "Sample solutions for <a href=\"http://exercism.io/\" target=\"_blank\" >exercism.io</a>", "d7/db5/md_exercism__r_e_a_d_m_e.html", null ],
    [ "Hash algorithms", "d4/dcb/md_hash__r_e_a_d_m_e.html", null ],
    [ "LeetCode", "d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html", null ],
    [ "📚 Contributing 📚", "df/d58/md_leetcode__r_e_a_d_m_e.html", [
-      [ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ],
-      [ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74", null ],
-      [ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75", null ]
+      [ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74", null ],
+      [ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75", null ],
+      [ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md76", null ]
    ] ],
    [ "ProjectEuler", "d8/d81/md_project_euler__r_e_a_d_m_e.html", null ],
    [ "Guidelines for reviewers and maintainers", "dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html", null ],
@ -134,9 +136,9 @@ var NAVTREEINDEX =
 [
 "annotated.html",
 "d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350",
-"d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453",
-"db/d80/problem__20_2sol1_8c.html#a0dd8af03e6cc8187e996db564ff90960",
-"df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba"
+"d7/d3b/group__hash.html#gaaf1984a095293c68f7dad2d31790ec3b",
+"db/d80/problem__20_2sol1_8c.html",
+"df/d16/palindrome_8c.html"
 ];

 var SYNCONMSG = 'click to disable panel synchronisation';
--- a/navtreeindex1.js
+++ b/navtreeindex1.js
@ -104,26 +104,26 @@ var NAVTREEINDEX1 =
 "d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,19,18,2,1],
 "d5/d7e/struct_t.html":[15,0,46],
 "d5/d88/md__d_i_r_e_c_t_o_r_y.html":[7],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[7,0],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[7,1],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,2],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,3],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,4],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,5],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,6],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,7],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,8],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,9],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,10],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,11],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,12],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,13],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,14],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,15],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,16],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[7,17],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65":[7,18],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66":[7,19],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[7,0],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,1],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,2],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,3],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,4],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,5],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,6],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,7],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,8],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,9],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,10],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,11],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,12],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,13],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,14],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,15],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[7,16],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65":[7,17],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66":[7,18],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67":[7,19],
 "d5/da1/structnode.html":[15,0,33],
 "d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,33,6],
 "d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,33,3],
@ -215,16 +215,17 @@ var NAVTREEINDEX1 =
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24":[3,1,3,0],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25":[3,1,3,1],
 "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26":[3,1,3,2],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,3,3],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,3,4],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,3,5],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,5,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,3,6],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,4],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,1],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,2],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,4,3],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,3,2,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,3,3],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,3,4],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,5],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,3,5,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,3,6],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,4,2],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37":[3,1,4,3],
 "d6/ded/shell__sort2_8c.html":[16,0,21,12],
 "d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,21,12,0],
 "d6/df3/graph_8h_source.html":[16,0,4,4,0],
@ -248,6 +249,5 @@ var NAVTREEINDEX1 =
 "d7/d3b/group__hash.html#ga8ab8eeb35f8ccfcad89091b5fdd4f605":[14,1,23],
 "d7/d3b/group__hash.html#ga94c9f3e74306c2b7ac5f141d8454dbe9":[14,1,29],
 "d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd":[14,1,24],
-"d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5":[14,1,26],
-"d7/d3b/group__hash.html#gaaf1984a095293c68f7dad2d31790ec3b":[14,1,13]
+"d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5":[14,1,26]
 };
--- a/navtreeindex2.js
+++ b/navtreeindex2.js
@ -1,5 +1,6 @@
 var NAVTREEINDEX2 =
 {
+"d7/d3b/group__hash.html#gaaf1984a095293c68f7dad2d31790ec3b":[14,1,13],
 "d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453":[14,1,27],
 "d7/d3b/group__hash.html#gabaac4e8c647ac9882ec38de284382c0b":[14,1,32],
 "d7/d3b/group__hash.html#gac1a3efdb45c4a807074d73fb8435144f":[14,1,36],
@ -111,9 +112,9 @@ var NAVTREEINDEX2 =
 "d8/de0/problem__9_2sol2_8c.html":[16,0,19,22,1],
 "d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,19,22,1,0],
 "d9/d41/md_data_structures_array__r_e_a_d_m_e.html":[4],
-"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38":[4,0],
-"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,1],
-"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40":[4,2],
+"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,0],
+"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40":[4,1],
+"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md41":[4,2],
 "d9/d66/group__machine__learning.html":[14,2],
 "d9/d8b/structmat__3x3__.html":[14,0,1,0],
 "d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[14,0,1,0,2],
@ -248,6 +249,5 @@ var NAVTREEINDEX2 =
 "db/d0c/infix__to__postfix_8c.html#ac91f38ad7885fca93e39325361a5c787":[16,0,3,5,2],
 "db/d0c/infix__to__postfix_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,5,5],
 "db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021":[16,0,3,5,3],
-"db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b":[16,0,3,5,4],
-"db/d80/problem__20_2sol1_8c.html":[16,0,19,9,0]
+"db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b":[16,0,3,5,4]
 };
--- a/navtreeindex3.js
+++ b/navtreeindex3.js
@ -1,5 +1,6 @@
 var NAVTREEINDEX3 =
 {
+"db/d80/problem__20_2sol1_8c.html":[16,0,19,9,0],
 "db/d80/problem__20_2sol1_8c.html#a0dd8af03e6cc8187e996db564ff90960":[16,0,19,9,0,2],
 "db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,19,9,0,3],
 "db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[16,0,19,9,0,4],
@ -248,6 +249,5 @@ var NAVTREEINDEX3 =
 "de/dff/heap__sort__2_8c.html#a672a47d865e7fa18f1ff23001ef4a485":[16,0,21,4,2],
 "de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,21,4,5],
 "de/dff/heap__sort__2_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,21,4,4],
-"de/dff/heap__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,21,4,3],
-"df/d16/palindrome_8c.html":[16,0,15,8]
+"de/dff/heap__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,21,4,3]
 };
--- a/navtreeindex4.js
+++ b/navtreeindex4.js
@ -1,5 +1,6 @@
 var NAVTREEINDEX4 =
 {
+"df/d16/palindrome_8c.html":[16,0,15,8],
 "df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba":[16,0,15,8,0],
 "df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,8,1],
 "df/d1a/problem__21_2sol1_8c.html":[16,0,19,10,0],
@ -34,9 +35,9 @@ var NAVTREEINDEX4 =
 "df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,16,3,2],
 "df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,16,3,4],
 "df/d58/md_leetcode__r_e_a_d_m_e.html":[11],
-"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,0],
-"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,1],
-"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75":[11,2],
+"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,0],
+"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75":[11,1],
+"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md76":[11,2],
 "df/d83/selection__sort_8c.html":[16,0,21,10],
 "df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,21,10,3],
 "df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,21,10,0],
@ -194,10 +195,10 @@ var NAVTREEINDEX4 =
 "globals_z.html":[16,1,0,25],
 "index.html":[],
 "index.html":[0],
-"index.html#autotoc_md77":[0,0],
-"index.html#autotoc_md78":[0,1],
-"index.html#autotoc_md79":[0,2],
-"index.html#autotoc_md80":[0,3],
+"index.html#autotoc_md78":[0,0],
+"index.html#autotoc_md79":[0,1],
+"index.html#autotoc_md80":[0,2],
+"index.html#autotoc_md81":[0,3],
 "modules.html":[14],
 "pages.html":[]
 };