Documentation for 8fa62620c2

2023-10-11 15:56:24 +08:00 · 2022-10-24 19:55:11 +00:00 · 2022-10-24 19:55:11 +00:00 · 9e8da353d0
commit 9e8da353d0
parent 3d0fd43c10
14 changed files with 72 additions and 73 deletions
--- 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
@ -5,7 +5,7 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.9.5"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C: List of all files</title>
+<title>Algorithms_in_C: Audio</title>
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
@ -97,15 +97,13 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
 </div>

 <div><div class="header">
-  <div class="headertitle"><div class="title">List of all files </div></div>
+  <div class="headertitle"><div class="title">Audio </div></div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><h1><a class="anchor" id="autotoc_md45"></a>
-Audio</h1>
-<ul>
+<div class="textblock"><ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/audio/alaw.c" target="_blank">Alaw</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md46"></a>
+<h1><a class="anchor" id="autotoc_md45"></a>
 Client Server</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/client_server/client.c" target="_blank">Client</a></li>
@ -119,7 +117,7 @@ Client Server</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/client_server/udp_client.c" target="_blank">Udp Client</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/client_server/udp_server.c" target="_blank">Udp Server</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md47"></a>
+<h1><a class="anchor" id="autotoc_md46"></a>
 Conversions</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/conversions/binary_to_decimal.c" target="_blank">Binary To Decimal</a></li>
@ -142,7 +140,7 @@ Conversions</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/conversions/octal_to_hexadecimal.c" target="_blank">Octal To Hexadecimal</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/conversions/to_decimal.c" target="_blank">To Decimal</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md48"></a>
+<h1><a class="anchor" id="autotoc_md47"></a>
 Data Structures</h1>
 <ul>
 <li>Array<ul>
@ -246,7 +244,7 @@ Data Structures</h1>
 </ul>
 </li>
 </ul>
-<h1><a class="anchor" id="autotoc_md49"></a>
+<h1><a class="anchor" id="autotoc_md48"></a>
 Developer Tools</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/developer_tools/malloc_dbg.c" target="_blank">Malloc Dbg</a></li>
@ -255,7 +253,7 @@ Developer Tools</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/developer_tools/test_malloc_dbg.c" target="_blank">Test Malloc Dbg</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/developer_tools/test_min_printf.c" target="_blank">Test Min Printf</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md50"></a>
+<h1><a class="anchor" id="autotoc_md49"></a>
 Exercism</h1>
 <ul>
 <li>Acronym<ul>
@ -284,31 +282,31 @@ Exercism</h1>
 </ul>
 </li>
 </ul>
-<h1><a class="anchor" id="autotoc_md51"></a>
+<h1><a class="anchor" id="autotoc_md50"></a>
 Games</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/games/naval_battle.c" target="_blank">Naval Battle</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/games/tic_tac_toe.c" target="_blank">Tic Tac Toe</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md52"></a>
+<h1><a class="anchor" id="autotoc_md51"></a>
 Geometry</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/geometry/geometry_datatypes.h" target="_blank">Geometry Datatypes</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/geometry/quaternions.c" target="_blank">Quaternions</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/geometry/vectors_3d.c" target="_blank">Vectors 3D</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md53"></a>
+<h1><a class="anchor" id="autotoc_md52"></a>
 Graphics</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/graphics/spirograph.c" target="_blank">Spirograph</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md54"></a>
+<h1><a class="anchor" id="autotoc_md53"></a>
 Greedy Approach</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/greedy_approach/dijkstra.c" target="_blank">Dijkstra</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/greedy_approach/prim.c" target="_blank">Prim</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md55"></a>
+<h1><a class="anchor" id="autotoc_md54"></a>
 Hash</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/hash/hash_adler32.c" target="_blank">Hash Adler32</a></li>
@ -317,7 +315,7 @@ Hash</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/hash/hash_sdbm.c" target="_blank">Hash Sdbm</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/hash/hash_xor8.c" target="_blank">Hash Xor8</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md56"></a>
+<h1><a class="anchor" id="autotoc_md55"></a>
 Leetcode</h1>
 <ul>
 <li>Src<ul>
@ -330,6 +328,7 @@ Leetcode</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/11.c" target="_blank">11</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/110.c" target="_blank">110</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/112.c" target="_blank">112</a></li>
+<li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/118.c" target="_blank">118</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1184.c" target="_blank">1184</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1189.c" target="_blank">1189</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/12.c" target="_blank">12</a></li>
@ -353,6 +352,7 @@ Leetcode</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/203.c" target="_blank">203</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/206.c" target="_blank">206</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/21.c" target="_blank">21</a></li>
+<li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/2130.c" target="_blank">2130</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/215.c" target="_blank">215</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/217.c" target="_blank">217</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/226.c" target="_blank">226</a></li>
@ -386,6 +386,7 @@ Leetcode</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/561.c" target="_blank">561</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/6.c" target="_blank">6</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/617.c" target="_blank">617</a></li>
+<li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/62.c" target="_blank">62</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/647.c" target="_blank">647</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/66.c" target="_blank">66</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/src/674.c" target="_blank">674</a></li>
@ -410,7 +411,7 @@ Leetcode</h1>
 </ul>
 </li>
 </ul>
-<h1><a class="anchor" id="autotoc_md57"></a>
+<h1><a class="anchor" id="autotoc_md56"></a>
 Machine Learning</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/machine_learning/adaline_learning.c" target="_blank">Adaline Learning</a></li>
@ -418,7 +419,7 @@ Machine Learning</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/machine_learning/kohonen_som_topology.c" target="_blank">Kohonen Som Topology</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/machine_learning/kohonen_som_trace.c" target="_blank">Kohonen Som Trace</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md58"></a>
+<h1><a class="anchor" id="autotoc_md57"></a>
 Misc</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/misc/armstrong_number.c" target="_blank">Armstrong Number</a></li>
@ -457,7 +458,7 @@ Misc</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/misc/tower_of_hanoi.c" target="_blank">Tower Of Hanoi</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/misc/union_find.c" target="_blank">Union Find</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md59"></a>
+<h1><a class="anchor" id="autotoc_md58"></a>
 Numerical Methods</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/numerical_methods/durand_kerner_roots.c" target="_blank">Durand Kerner Roots</a></li>
@ -478,7 +479,7 @@ Numerical Methods</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/numerical_methods/simpsons_1_3rd_rule.c" target="_blank">Simpsons 1 3Rd Rule</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/numerical_methods/variance.c" target="_blank">Variance</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md60"></a>
+<h1><a class="anchor" id="autotoc_md59"></a>
 Project Euler</h1>
 <ul>
 <li>Problem 1<ul>
@ -585,7 +586,7 @@ Project Euler</h1>
 </ul>
 </li>
 </ul>
-<h1><a class="anchor" id="autotoc_md61"></a>
+<h1><a class="anchor" id="autotoc_md60"></a>
 Searching</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/searching/binary_search.c" target="_blank">Binary Search</a></li>
@ -606,7 +607,7 @@ Searching</h1>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/searching/sentinel_linear_search.c" target="_blank">Sentinel Linear Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/searching/ternary_search.c" target="_blank">Ternary Search</a></li>
 </ul>
-<h1><a class="anchor" id="autotoc_md62"></a>
+<h1><a class="anchor" id="autotoc_md61"></a>
 Sorting</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C/blob/master/sorting/bead_sort.c" target="_blank">Bead Sort</a></li>
--- 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_md64"></a>
+<h2><a class="anchor" id="autotoc_md63"></a>
 Overview</h2>
 <p >In this directory you will find (in the right order):</p><ul>
 <li>hello-world</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_md75"></a>
+<h2><a class="anchor" id="autotoc_md74"></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_md74"></a>
+<h2><a class="anchor" id="autotoc_md73"></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/df/d58/md_leetcode__r_e_a_d_m_e.html
+++ b/df/d58/md_leetcode__r_e_a_d_m_e.html
@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
  <div class="headertitle"><div class="title">LeetCode </div></div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><h2><a class="anchor" id="autotoc_md67"></a>
+<div class="textblock"><h2><a class="anchor" id="autotoc_md66"></a>
 LeetCode Algorithm</h2>
 <table class="markdownTable">
 <tr class="markdownTableHead">
--- 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://lgtm.com/projects/g/TheAlgorithms/C/context:cpp" target="_blank"><img src="https://img.shields.io/lgtm/grade/cpp/g/TheAlgorithms/C.svg?logo=lgtm&amp;logoWidth=18" alt="Language grade: C/C++" style="pointer-events: none;" 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_analysis.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_md69"></a>
+<h1><a class="anchor" id="autotoc_md68"></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_md70"></a>
+<h1><a class="anchor" id="autotoc_md69"></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_md71"></a>
+<h1><a class="anchor" id="autotoc_md70"></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_md72"></a>
+<h1><a class="anchor" id="autotoc_md71"></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/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_md69", null ],
-      [ "Features", "index.html#autotoc_md70", null ],
-      [ "Documentation", "index.html#autotoc_md71", null ],
-      [ "Contributions", "index.html#autotoc_md72", null ]
+      [ "Overview", "index.html#autotoc_md68", null ],
+      [ "Features", "index.html#autotoc_md69", null ],
+      [ "Documentation", "index.html#autotoc_md70", null ],
+      [ "Contributions", "index.html#autotoc_md71", null ]
    ] ],
    [ "Contributor Covenant Code of Conduct", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html", [
      [ "Our Pledge", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md1", null ],
@ -78,25 +78,24 @@ var NAVTREE =
    ] ],
    [ "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 ],
-    [ "List of all files", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [
-      [ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md45", null ],
-      [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46", null ],
-      [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ],
-      [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
-      [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
-      [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
-      [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
-      [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
-      [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
-      [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
-      [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
-      [ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
-      [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
-      [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
-      [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
-      [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
-      [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
-      [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ]
+    [ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [
+      [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md45", null ],
+      [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46", null ],
+      [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ],
+      [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
+      [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
+      [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
+      [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
+      [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
+      [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
+      [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
+      [ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
+      [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
+      [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
+      [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
+      [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
+      [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
+      [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", 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 ],
@ -129,8 +128,8 @@ var NAVTREEINDEX =
 [
 "annotated.html",
 "d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3",
-"d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e",
-"dd/d8b/problem__22_2sol1_8c.html"
+"d9/da7/problem__10_2sol2_8c.html",
+"dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627"
 ];

 var SYNCONMSG = 'click to disable panel synchronisation';
--- a/navtreeindex1.js
+++ b/navtreeindex1.js
@ -73,7 +73,6 @@ var NAVTREEINDEX1 =
 "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,14],
 "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,15],
 "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,16],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,17],
 "d5/da1/structnode.html":[14,0,26],
 "d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[14,0,26,0],
 "d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c":[14,0,26,2],
@ -249,5 +248,6 @@ var NAVTREEINDEX1 =
 "d9/d66/group__machine__learning.html":[13,2],
 "d9/d8b/structmat__3x3__.html":[13,0,1,0],
 "d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[13,0,1,0,2],
-"d9/d8b/structmat__3x3__.html#a8d7ae8fbcc408e3c30e9d64bbd28feaf":[13,0,1,0,1]
+"d9/d8b/structmat__3x3__.html#a8d7ae8fbcc408e3c30e9d64bbd28feaf":[13,0,1,0,1],
+"d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e":[13,0,1,0,0]
 };
--- a/navtreeindex2.js
+++ b/navtreeindex2.js
@ -1,6 +1,5 @@
 var NAVTREEINDEX2 =
 {
-"d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e":[13,0,1,0,0],
 "d9/da7/problem__10_2sol2_8c.html":[15,0,15,1,1],
 "d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[15,0,15,1,1,0],
 "d9/dc9/hash__crc32_8c.html":[13,1,1],
@ -249,5 +248,6 @@ var NAVTREEINDEX2 =
 "dd/d79/remote__command__exec__udp__server_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce":[15,0,1,2,1],
 "dd/d79/remote__command__exec__udp__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[15,0,1,2,2],
 "dd/d7a/group__matrix.html":[13,0,1],
-"dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7":[13,0,1,1]
+"dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7":[13,0,1,1],
+"dd/d8b/problem__22_2sol1_8c.html":[15,0,15,11,0]
 };
--- a/navtreeindex3.js
+++ b/navtreeindex3.js
@ -1,6 +1,5 @@
 var NAVTREEINDEX3 =
 {
-"dd/d8b/problem__22_2sol1_8c.html":[15,0,15,11,0],
 "dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[15,0,15,11,0,3],
 "dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63":[15,0,15,11,0,4],
 "dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38":[15,0,15,11,0,1],
@ -234,10 +233,10 @@ var NAVTREEINDEX3 =
 "globals_x.html":[15,1,0,24],
 "index.html":[],
 "index.html":[0],
-"index.html#autotoc_md69":[0,0],
-"index.html#autotoc_md70":[0,1],
-"index.html#autotoc_md71":[0,2],
-"index.html#autotoc_md72":[0,3],
+"index.html#autotoc_md68":[0,0],
+"index.html#autotoc_md69":[0,1],
+"index.html#autotoc_md70":[0,2],
+"index.html#autotoc_md71":[0,3],
 "modules.html":[13],
 "pages.html":[]
 };
--- a/pages.html
+++ b/pages.html
@ -108,7 +108,7 @@ $(document).ready(function(){initNavTree('pages.html',''); initResizable(); });
 <tr id="row_3_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d9/d41/md_data_structures_array__r_e_a_d_m_e.html" target="_self">Array</a></td><td class="desc"></td></tr>
 <tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html" target="_self">Dictionary</a></td><td class="desc"></td></tr>
 <tr id="row_5_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d1/d12/md_data_structures_stack__r_e_a_d_m_e.html" target="_self">Simple generic Stack</a></td><td class="desc"></td></tr>
-<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d5/d88/md__d_i_r_e_c_t_o_r_y.html" target="_self">List of all files</a></td><td class="desc"></td></tr>
+<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d5/d88/md__d_i_r_e_c_t_o_r_y.html" target="_self">Audio</a></td><td class="desc"></td></tr>
 <tr id="row_7_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d7/db5/md_exercism__r_e_a_d_m_e.html" target="_self">Sample solutions for &lt;a href=&quot;http://exercism.io/&quot; target=&quot;_blank&quot; &gt;exercism.io&lt;/a&gt;</a></td><td class="desc"></td></tr>
 <tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d4/dcb/md_hash__r_e_a_d_m_e.html" target="_self">Hash algorithms</a></td><td class="desc"></td></tr>
 <tr id="row_9_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="df/d58/md_leetcode__r_e_a_d_m_e.html" target="_self">LeetCode</a></td><td class="desc"></td></tr>
--- a/search/all_3.js
+++ b/search/all_3.js
@ -21,5 +21,6 @@ var searchData=
  ['allocatememoryfornode_18',['allocateMemoryForNode',['../d3/d78/words__alphabetical_8c.html#a1e5ad8401396df36ab585d79f3309fd9',1,'words_alphabetical.c']]],
  ['array_19',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]],
  ['atexitcalled_20',['atexitCalled',['../db/d84/malloc__dbg_8c.html#ad04afbbcb9f0f10bc7628ec4f0d7c950',1,'malloc_dbg.c']]],
-  ['avlnode_21',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
+  ['audio_21',['Audio',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
+  ['avlnode_22',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
 ];
--- a/search/all_e.js
+++ b/search/all_e.js
@ -13,8 +13,7 @@ var searchData=
  ['line_10',['line',['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a731603550d2238abb179f2b572f20d99',1,'MEMORY_INFORMATION']]],
  ['list_11',['list',['../d8/d10/structlist.html',1,'']]],
  ['list_12',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]],
-  ['list_20of_20all_20files_13',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
-  ['llink_14',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
-  ['lu_5fdecompose_2ec_15',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
-  ['lu_5fdecomposition_16',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
+  ['llink_13',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
+  ['lu_5fdecompose_2ec_14',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
+  ['lu_5fdecomposition_15',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
 ];
--- a/search/pages_0.js
+++ b/search/pages_0.js
@ -1,4 +1,5 @@
 var searchData=
 [
-  ['array_0',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]]
+  ['array_0',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]],
+  ['audio_1',['Audio',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]]
 ];
--- a/search/pages_5.js
+++ b/search/pages_5.js
@ -1,5 +1,4 @@
 var searchData=
 [
-  ['leetcode_0',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]],
-  ['list_20of_20all_20files_1',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]]
+  ['leetcode_0',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]]
 ];