Documentation for a4e7b7bc4b

This commit is contained in:
github-actions 2022-12-24 01:52:24 +00:00
parent 42a36c7794
commit a7db995d61
47 changed files with 1676 additions and 803 deletions

View File

@ -110,42 +110,42 @@ $(document).ready(function(){initNavTree('d2/de8/structeuler__.html','../../');
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:a19588bc8d7de583e844c844977300ab8"><td class="memItemLeft" ><a id="a19588bc8d7de583e844c844977300ab8" name="a19588bc8d7de583e844c844977300ab8"></a>
<tr class="memitem:ac26c178ed5737d239fda2d0e5216b12c"><td class="memItemLeft" ><a id="ac26c178ed5737d239fda2d0e5216b12c" name="ac26c178ed5737d239fda2d0e5216b12c"></a>
union {</td></tr>
<tr class="memitem:a16e87a7bce4410e5636a802ef9fbe1b9"><td class="memItemLeft" >
<tr class="memitem:a7fca1e32d9cf0b5f62b7c523ff387509"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>roll</b></td></tr>
<tr class="memdesc:a16e87a7bce4410e5636a802ef9fbe1b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">or bank \(\phi\) = rotation about X axis <br /></td></tr>
<tr class="separator:a16e87a7bce4410e5636a802ef9fbe1b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa6213b4fb699384f0c056a1ae85465fa"><td class="memItemLeft" >
<tr class="memdesc:a7fca1e32d9cf0b5f62b7c523ff387509"><td class="mdescLeft">&#160;</td><td class="mdescRight">or bank \(\phi\) = rotation about X axis <br /></td></tr>
<tr class="separator:a7fca1e32d9cf0b5f62b7c523ff387509"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b47d86b928af2595e7339b69e939f4c"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>bank</b></td></tr>
<tr class="memdesc:aa6213b4fb699384f0c056a1ae85465fa"><td class="mdescLeft">&#160;</td><td class="mdescRight">or roll \(\phi\) = rotation about X axis <br /></td></tr>
<tr class="separator:aa6213b4fb699384f0c056a1ae85465fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a19588bc8d7de583e844c844977300ab8"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a19588bc8d7de583e844c844977300ab8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0da0ad066c09e701ab05a0f9d8f93d43"><td class="memItemLeft" ><a id="a0da0ad066c09e701ab05a0f9d8f93d43" name="a0da0ad066c09e701ab05a0f9d8f93d43"></a>
<tr class="memdesc:a0b47d86b928af2595e7339b69e939f4c"><td class="mdescLeft">&#160;</td><td class="mdescRight">or roll \(\phi\) = rotation about X axis <br /></td></tr>
<tr class="separator:a0b47d86b928af2595e7339b69e939f4c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac26c178ed5737d239fda2d0e5216b12c"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:ac26c178ed5737d239fda2d0e5216b12c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa26a0125b12dbaf67dd9d13bc61351ab"><td class="memItemLeft" ><a id="aa26a0125b12dbaf67dd9d13bc61351ab" name="aa26a0125b12dbaf67dd9d13bc61351ab"></a>
union {</td></tr>
<tr class="memitem:a2e6b44309e7f7ebeec85d4ad325ff36a"><td class="memItemLeft" >
<tr class="memitem:af778ba77db744831ee7f0128df913ea9"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>pitch</b></td></tr>
<tr class="memdesc:a2e6b44309e7f7ebeec85d4ad325ff36a"><td class="mdescLeft">&#160;</td><td class="mdescRight">or elevation \(\theta\) = rotation about Y axis <br /></td></tr>
<tr class="separator:a2e6b44309e7f7ebeec85d4ad325ff36a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad1752f6ac6adf2fffbc5d40c2dd6c852"><td class="memItemLeft" >
<tr class="memdesc:af778ba77db744831ee7f0128df913ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">or elevation \(\theta\) = rotation about Y axis <br /></td></tr>
<tr class="separator:af778ba77db744831ee7f0128df913ea9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6c99e5997af549f800551132f7155c6a"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>elevation</b></td></tr>
<tr class="memdesc:ad1752f6ac6adf2fffbc5d40c2dd6c852"><td class="mdescLeft">&#160;</td><td class="mdescRight">or pitch \(\theta\) = rotation about Y axis <br /></td></tr>
<tr class="separator:ad1752f6ac6adf2fffbc5d40c2dd6c852"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0da0ad066c09e701ab05a0f9d8f93d43"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a0da0ad066c09e701ab05a0f9d8f93d43"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada4319aab292117f98d02f768072103c"><td class="memItemLeft" ><a id="ada4319aab292117f98d02f768072103c" name="ada4319aab292117f98d02f768072103c"></a>
<tr class="memdesc:a6c99e5997af549f800551132f7155c6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">or pitch \(\theta\) = rotation about Y axis <br /></td></tr>
<tr class="separator:a6c99e5997af549f800551132f7155c6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa26a0125b12dbaf67dd9d13bc61351ab"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:aa26a0125b12dbaf67dd9d13bc61351ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a119e45cb1363bf70f61ef525e2d562fc"><td class="memItemLeft" ><a id="a119e45cb1363bf70f61ef525e2d562fc" name="a119e45cb1363bf70f61ef525e2d562fc"></a>
union {</td></tr>
<tr class="memitem:a18443757e202751b5bacd3f8d0bc618a"><td class="memItemLeft" >
<tr class="memitem:a94b59971580d6f0fb32d4ec8c61567a7"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>yaw</b></td></tr>
<tr class="memdesc:a18443757e202751b5bacd3f8d0bc618a"><td class="mdescLeft">&#160;</td><td class="mdescRight">or heading \(\psi\) = rotation about Z axis <br /></td></tr>
<tr class="separator:a18443757e202751b5bacd3f8d0bc618a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a15cdcd18de4373fce6bb5b1a5644a0b5"><td class="memItemLeft" >
<tr class="memdesc:a94b59971580d6f0fb32d4ec8c61567a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">or heading \(\psi\) = rotation about Z axis <br /></td></tr>
<tr class="separator:a94b59971580d6f0fb32d4ec8c61567a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a80f157fd725937a6b5fbd22d3a0dfa7c"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>heading</b></td></tr>
<tr class="memdesc:a15cdcd18de4373fce6bb5b1a5644a0b5"><td class="mdescLeft">&#160;</td><td class="mdescRight">or yaw \(\psi\) = rotation about Z axis <br /></td></tr>
<tr class="separator:a15cdcd18de4373fce6bb5b1a5644a0b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada4319aab292117f98d02f768072103c"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:ada4319aab292117f98d02f768072103c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memdesc:a80f157fd725937a6b5fbd22d3a0dfa7c"><td class="mdescLeft">&#160;</td><td class="mdescRight">or yaw \(\psi\) = rotation about Z axis <br /></td></tr>
<tr class="separator:a80f157fd725937a6b5fbd22d3a0dfa7c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a119e45cb1363bf70f61ef525e2d562fc"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a119e45cb1363bf70f61ef525e2d562fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >3D Euler or Tait-Bryan angles (in radian) </p>

View File

@ -257,6 +257,11 @@ Developer Tools</h1>
<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_md51"></a>
Dynamic Programming</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/lcs.c" target="_blank">Lcs</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md52"></a>
Exercism</h1>
<ul>
<li>Acronym<ul>
@ -285,31 +290,31 @@ Exercism</h1>
</ul>
</li>
</ul>
<h1><a class="anchor" id="autotoc_md52"></a>
<h1><a class="anchor" id="autotoc_md53"></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_md53"></a>
<h1><a class="anchor" id="autotoc_md54"></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_md54"></a>
<h1><a class="anchor" id="autotoc_md55"></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_md55"></a>
<h1><a class="anchor" id="autotoc_md56"></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_md56"></a>
<h1><a class="anchor" id="autotoc_md57"></a>
Hash</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c" target="_blank">Hash Adler32</a></li>
@ -318,7 +323,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_md57"></a>
<h1><a class="anchor" id="autotoc_md58"></a>
Leetcode</h1>
<ul>
<li>Src<ul>
@ -385,6 +390,7 @@ Leetcode</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/26.c" target="_blank">26</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/268.c" target="_blank">268</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/27.c" target="_blank">27</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/274.c" target="_blank">274</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/278.c" target="_blank">278</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/28.c" target="_blank">28</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/283.c" target="_blank">283</a></li>
@ -443,7 +449,7 @@ Leetcode</h1>
</ul>
</li>
</ul>
<h1><a class="anchor" id="autotoc_md58"></a>
<h1><a class="anchor" id="autotoc_md59"></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>
@ -451,47 +457,51 @@ 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_md59"></a>
<h1><a class="anchor" id="autotoc_md60"></a>
Math</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/armstrong_number.c" target="_blank">Armstrong Number</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/cantor_set.c" target="_blank">Cantor Set</a></li>
<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/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>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci.c" target="_blank">Fibonacci</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci_dp.c" target="_blank">Fibonacci Dp</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci_fast.c" target="_blank">Fibonacci Fast</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci_formula.c" target="_blank">Fibonacci Formula</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/gcd.c" target="_blank">Gcd</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/is_armstrong.c" target="_blank">Is Armstrong</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/large_factorials.c" target="_blank">Large Factorials</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/lcm.c" target="_blank">Lcm</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/lerp.c" target="_blank">Lerp</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/palindrome.c" target="_blank">Palindrome</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/prime.c" target="_blank">Prime</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/math/prime_factoriziation.c" target="_blank">Prime Factoriziation</a></li>
<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>
Misc</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/armstrong_number.c" target="_blank">Armstrong Number</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/cantor_set.c" target="_blank">Cantor Set</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/cartesian_to_polar.c" target="_blank">Cartesian To Polar</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/catalan.c" target="_blank">Catalan</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/collatz.c" target="_blank">Collatz</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/demonetization.c" target="_blank">Demonetization</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/factorial.c" target="_blank">Factorial</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/factorial_large_number.c" target="_blank">Factorial Large Number</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/factorial_trailing_zeroes.c" target="_blank">Factorial Trailing Zeroes</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci.c" target="_blank">Fibonacci</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci_dp.c" target="_blank">Fibonacci Dp</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci_fast.c" target="_blank">Fibonacci Fast</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci_formula.c" target="_blank">Fibonacci Formula</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/gcd.c" target="_blank">Gcd</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/is_armstrong.c" target="_blank">Is Armstrong</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/large_factorials.c" target="_blank">Large Factorials</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/lcm.c" target="_blank">Lcm</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/lerp.c" target="_blank">Lerp</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/lexicographic_permutations.c" target="_blank">Lexicographic Permutations</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/longest_subsequence.c" target="_blank">Longest Subsequence</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/mirror.c" target="_blank">Mirror</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/palindrome.c" target="_blank">Palindrome</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/pid.c" target="_blank">Pid</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/poly_add.c" target="_blank">Poly Add</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/postfix_evaluation.c" target="_blank">Postfix Evaluation</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/prime.c" target="_blank">Prime</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/prime_factoriziation.c" target="_blank">Prime Factoriziation</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/prime_seive.c" target="_blank">Prime Seive</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/quartile.c" target="_blank">Quartile</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/rot13.c" target="_blank">Rot13</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/rselect.c" target="_blank">Rselect</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/run_length_encoding.c" target="_blank">Run Length Encoding</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/strong_number.c" target="_blank">Strong Number</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/misc/sudoku_solver.c" target="_blank">Sudoku Solver</a></li>
<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_md60"></a>
<h1><a class="anchor" id="autotoc_md62"></a>
Numerical Methods</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/durand_kerner_roots.c" target="_blank">Durand Kerner Roots</a></li>
@ -512,12 +522,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_md61"></a>
<h1><a class="anchor" id="autotoc_md63"></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_md62"></a>
<h1><a class="anchor" id="autotoc_md64"></a>
Project Euler</h1>
<ul>
<li>Problem 1<ul>
@ -624,7 +634,7 @@ Project Euler</h1>
</ul>
</li>
</ul>
<h1><a class="anchor" id="autotoc_md63"></a>
<h1><a class="anchor" id="autotoc_md65"></a>
Searching</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c" target="_blank">Binary Search</a></li>
@ -645,7 +655,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_md64"></a>
<h1><a class="anchor" id="autotoc_md66"></a>
Sorting</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c" target="_blank">Bead Sort</a></li>

View File

@ -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_md69"></a>
<div class="textblock"><h2><a class="anchor" id="autotoc_md71"></a>
LeetCode Algorithm</h2>
<table class="markdownTable">
<tr class="markdownTableHead">

View File

@ -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_md66"></a>
<h2><a class="anchor" id="autotoc_md68"></a>
Overview</h2>
<p >In this directory you will find (in the right order):</p><ul>
<li>hello-world</li>

View File

@ -116,39 +116,39 @@ Collaboration diagram for mat_3x3_:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:a000f4088a696efa570718f8804c47e2c"><td class="memItemLeft" ><a id="a000f4088a696efa570718f8804c47e2c" name="a000f4088a696efa570718f8804c47e2c"></a>
<tr class="memitem:a88d390c525e9a59caba82cf636edddcf"><td class="memItemLeft" ><a id="a88d390c525e9a59caba82cf636edddcf" name="a88d390c525e9a59caba82cf636edddcf"></a>
union {</td></tr>
<tr class="memitem:acb4dbf8243704c62ca140dd432414bfe"><td class="memItemLeft" >
<tr class="memitem:ab84da758bc198d2fbb8af70ff9732f03"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>row1</b> [3]</td></tr>
<tr class="memdesc:acb4dbf8243704c62ca140dd432414bfe"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; 3 element row 1 <br /></td></tr>
<tr class="separator:acb4dbf8243704c62ca140dd432414bfe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a58541982878fb44e31589adbe34cbf48"><td class="memItemLeft" >
<tr class="memdesc:ab84da758bc198d2fbb8af70ff9732f03"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; 3 element row 1 <br /></td></tr>
<tr class="separator:ab84da758bc198d2fbb8af70ff9732f03"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a36dd0ba8168b7d0d8d9886f5b2dff3df"><td class="memItemLeft" >
&#160;&#160;&#160;<a class="el" href="../../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270">vec_3d</a>&#160;&#160;&#160;<b>vec1</b></td></tr>
<tr class="separator:a58541982878fb44e31589adbe34cbf48"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a000f4088a696efa570718f8804c47e2c"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a000f4088a696efa570718f8804c47e2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac37d40f4e10d65e3fceca7deec58cc86"><td class="memItemLeft" ><a id="ac37d40f4e10d65e3fceca7deec58cc86" name="ac37d40f4e10d65e3fceca7deec58cc86"></a>
<tr class="separator:a36dd0ba8168b7d0d8d9886f5b2dff3df"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88d390c525e9a59caba82cf636edddcf"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a88d390c525e9a59caba82cf636edddcf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6094cdf602c8ada040129b26136e10f7"><td class="memItemLeft" ><a id="a6094cdf602c8ada040129b26136e10f7" name="a6094cdf602c8ada040129b26136e10f7"></a>
union {</td></tr>
<tr class="memitem:a7d9e4d0d10e871f8f95b4fc92ea6a7e8"><td class="memItemLeft" >
<tr class="memitem:a49261fb887bc372ee8909543b05f6d83"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>row2</b> [3]</td></tr>
<tr class="memdesc:a7d9e4d0d10e871f8f95b4fc92ea6a7e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; 3 element row 2 <br /></td></tr>
<tr class="separator:a7d9e4d0d10e871f8f95b4fc92ea6a7e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9e435055b8eb21625e9245f1ef86ca27"><td class="memItemLeft" >
<tr class="memdesc:a49261fb887bc372ee8909543b05f6d83"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; 3 element row 2 <br /></td></tr>
<tr class="separator:a49261fb887bc372ee8909543b05f6d83"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a225aea8b7476524ef01e0eb2aed59053"><td class="memItemLeft" >
&#160;&#160;&#160;<a class="el" href="../../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270">vec_3d</a>&#160;&#160;&#160;<b>vec2</b></td></tr>
<tr class="separator:a9e435055b8eb21625e9245f1ef86ca27"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac37d40f4e10d65e3fceca7deec58cc86"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:ac37d40f4e10d65e3fceca7deec58cc86"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d8c2dfea2bc491c432c966ce20238b4"><td class="memItemLeft" ><a id="a6d8c2dfea2bc491c432c966ce20238b4" name="a6d8c2dfea2bc491c432c966ce20238b4"></a>
<tr class="separator:a225aea8b7476524ef01e0eb2aed59053"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6094cdf602c8ada040129b26136e10f7"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a6094cdf602c8ada040129b26136e10f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a19b11a456b1892f8078765fd3e8f90f3"><td class="memItemLeft" ><a id="a19b11a456b1892f8078765fd3e8f90f3" name="a19b11a456b1892f8078765fd3e8f90f3"></a>
union {</td></tr>
<tr class="memitem:ade064fa22e5e1be8178b4ac581238aeb"><td class="memItemLeft" >
<tr class="memitem:a8d8f6a23458ab34c11060e0266c5d8c0"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>row3</b> [3]</td></tr>
<tr class="memdesc:ade064fa22e5e1be8178b4ac581238aeb"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; 3 element row 3 <br /></td></tr>
<tr class="separator:ade064fa22e5e1be8178b4ac581238aeb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1264df94791b1861f3b884478910a9c8"><td class="memItemLeft" >
<tr class="memdesc:a8d8f6a23458ab34c11060e0266c5d8c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; 3 element row 3 <br /></td></tr>
<tr class="separator:a8d8f6a23458ab34c11060e0266c5d8c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a29655aa3a68162063b22b71f1130c728"><td class="memItemLeft" >
&#160;&#160;&#160;<a class="el" href="../../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270">vec_3d</a>&#160;&#160;&#160;<b>vec3</b></td></tr>
<tr class="separator:a1264df94791b1861f3b884478910a9c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d8c2dfea2bc491c432c966ce20238b4"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a6d8c2dfea2bc491c432c966ce20238b4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="separator:a29655aa3a68162063b22b71f1130c728"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a19b11a456b1892f8078765fd3e8f90f3"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a19b11a456b1892f8078765fd3e8f90f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >A 3x3 Matrix type definition. </p>

7
d9/dc3/lcs_8c__incl.map Normal file
View File

@ -0,0 +1,7 @@
<map id="dynamic_programming/lcs.c" name="dynamic_programming/lcs.c">
<area shape="rect" id="node1" title="Longest Common Subsequence algorithm" alt="" coords="90,5,243,45"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,93,67,119"/>
<area shape="rect" id="node3" title=" " alt="" coords="91,93,155,119"/>
<area shape="rect" id="node4" title=" " alt="" coords="179,93,245,119"/>
<area shape="rect" id="node5" title=" " alt="" coords="269,93,339,119"/>
</map>

1
d9/dc3/lcs_8c__incl.md5 Normal file
View File

@ -0,0 +1 @@
9f33855a9cf33a993ccb4f910e095d8c

82
d9/dc3/lcs_8c__incl.svg Normal file
View File

@ -0,0 +1,82 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.0.4 (20221203.1631)
-->
<!-- Title: dynamic_programming/lcs.c Pages: 1 -->
<svg width="258pt" height="93pt"
viewBox="0.00 0.00 258.00 93.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89)">
<title>dynamic_programming/lcs.c</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Longest Common Subsequence algorithm">
<polygon fill="#999999" stroke="#666666" points="178.5,-85 63.5,-85 63.5,-55 178.5,-55 178.5,-85"/>
<text text-anchor="start" x="71.5" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="121" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">/lcs.c</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="46,-19 0,-19 0,0 46,0 46,-19"/>
<text text-anchor="middle" x="23" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M96.78,-54.54C81.76,-45.58 62.54,-34.1 47.48,-25.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="49.5,-22.24 39.12,-20.12 45.91,-28.25 49.5,-22.24"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="112,-19 64,-19 64,0 112,0 112,-19"/>
<text text-anchor="middle" x="88" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">stdlib.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M112.84,-54.54C108.49,-46.82 103.09,-37.24 98.43,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.6,-27.48 93.64,-20.49 95.5,-30.92 101.6,-27.48"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="179.5,-19 130.5,-19 130.5,0 179.5,0 179.5,-19"/>
<text text-anchor="middle" x="155" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">string.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M129.4,-54.54C133.89,-46.82 139.46,-37.24 144.25,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.2,-30.89 149.2,-20.48 141.15,-27.37 147.2,-30.89"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="250,-19 198,-19 198,0 250,0 250,-19"/>
<text text-anchor="middle" x="224" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">assert.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M146.46,-54.54C162.39,-45.49 182.83,-33.88 198.73,-24.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.14,-28.08 207.11,-20.09 196.68,-21.99 200.14,-28.08"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 3.4 KiB

View File

@ -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_md82"></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_md81"></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">

489
db/de1/lcs_8c.html Normal file
View File

@ -0,0 +1,489 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<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: dynamic_programming/lcs.c File Reference</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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('db/de1/lcs_8c.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#enum-members">Enumerations</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">lcs.c File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" target="_blank">Longest Common Subsequence</a> algorithm
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
<code>#include &lt;string.h&gt;</code><br />
<code>#include &lt;assert.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for lcs.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dc3/lcs_8c__incl.svg" width="344" height="124"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="enum-members" name="enum-members"></a>
Enumerations</h2></td></tr>
<tr class="memitem:a06fc87d81c62e9abb8790b6e5713c55b"><td class="memItemLeft" align="right" valign="top">enum &#160;</td><td class="memItemRight" valign="bottom">{ <b>LEFT</b>
, <b>UP</b>
, <b>DIAG</b>
}</td></tr>
<tr class="separator:a06fc87d81c62e9abb8790b6e5713c55b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ac107a0b0233dacb9e8cd3a983d6740b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6">lcslen</a> (const char *s1, const char *s2, int l1, int l2, int **<a class="el" href="../../df/db3/struct_l.html">L</a>, int **B)</td></tr>
<tr class="memdesc:ac107a0b0233dacb9e8cd3a983d6740b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">@breif Computes LCS between s1 and s2 using a dynamic-programming approach <a href="../../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6">More...</a><br /></td></tr>
<tr class="separator:ac107a0b0233dacb9e8cd3a983d6740b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a741c9173a9fef243518f5c2352b81fc0"><td class="memItemLeft" align="right" valign="top">char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0">lcsbuild</a> (const char *s1, int l1, int l2, int **<a class="el" href="../../df/db3/struct_l.html">L</a>, int **B)</td></tr>
<tr class="memdesc:a741c9173a9fef243518f5c2352b81fc0"><td class="mdescLeft">&#160;</td><td class="mdescRight">@breif Builds the LCS according to B using a traceback approach <a href="../../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0">More...</a><br /></td></tr>
<tr class="separator:a741c9173a9fef243518f5c2352b81fc0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/de1/lcs_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../db/de1/lcs_8c.html#a0ddf1224851353fc92bfbff6f499fa97">More...</a><br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" target="_blank">Longest Common Subsequence</a> algorithm </p>
<p >From Wikipedia: The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/itskurtz" target="_blank">Kurtz</a> </dd></dl>
</div><h2 class="groupheader">Enumeration Type Documentation</h2>
<a id="a06fc87d81c62e9abb8790b6e5713c55b" name="a06fc87d81c62e9abb8790b6e5713c55b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a06fc87d81c62e9abb8790b6e5713c55b">&#9670;&#160;</a></span>anonymous enum</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">anonymous enum</td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 15</span>{LEFT, UP, DIAG};</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a741c9173a9fef243518f5c2352b81fc0" name="a741c9173a9fef243518f5c2352b81fc0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a741c9173a9fef243518f5c2352b81fc0">&#9670;&#160;</a></span>lcsbuild()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">char * lcsbuild </td>
<td>(</td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>s1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int **&#160;</td>
<td class="paramname"><em>L</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int **&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>@breif Builds the LCS according to B using a traceback approach </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">1</td><td>s1 first null-terminated string </td></tr>
<tr><td class="paramname">2</td><td>l1 length of s1 </td></tr>
<tr><td class="paramname">3</td><td>l2 length of s2 </td></tr>
<tr><td class="paramname">4</td><td><a class="el" href="../../df/db3/struct_l.html">L</a> matrix of size l1 x l2 </td></tr>
<tr><td class="paramname">5</td><td>B matrix of size l1 x l2 </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>lcs longest common subsequence </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">int</span> i, j, lcsl;</div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordtype">char</span> *lcs;</div>
<div class="line"><span class="lineno"> 62</span> lcsl = <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[l1][l2];</div>
<div class="line"><span class="lineno"> 63</span> </div>
<div class="line"><span class="lineno"> 64</span> <span class="comment">/* my lcs is at least the empty symbol */</span></div>
<div class="line"><span class="lineno"> 65</span> lcs = (<span class="keywordtype">char</span> *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(lcsl+1, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>)); <span class="comment">/* null-terminated \0 */</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (!lcs) {</div>
<div class="line"><span class="lineno"> 67</span> perror(<span class="stringliteral">&quot;calloc: &quot;</span>);</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">return</span> NULL;</div>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="line"><span class="lineno"> 70</span> </div>
<div class="line"><span class="lineno"> 71</span> i = l1, j = l2;</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">while</span> (i &gt; 0 &amp;&amp; j &gt; 0) {</div>
<div class="line"><span class="lineno"> 73</span> <span class="comment">/* walk the matrix backwards */</span></div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">if</span> (B[i][j] == DIAG) {</div>
<div class="line"><span class="lineno"> 75</span> lcs[--lcsl] = s1[i-1];</div>
<div class="line"><span class="lineno"> 76</span> i = i - 1;</div>
<div class="line"><span class="lineno"> 77</span> j = j - 1;</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (B[i][j] == LEFT)</div>
<div class="line"><span class="lineno"> 80</span> j = j - 1;</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 82</span> i = i - 1;</div>
<div class="line"><span class="lineno"> 83</span> }</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">return</span> lcs;</div>
<div class="line"><span class="lineno"> 85</span>}</div>
<div class="ttc" id="amalloc__dbg_8h_html_afdddaa949a93c1ef559a638e98f9c21b"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a></div><div class="ttdeci">#define calloc(elemCount, elemSize)</div><div class="ttdoc">This macro replace the standard calloc function with calloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:22</div></div>
<div class="ttc" id="astruct_l_html"><div class="ttname"><a href="../../df/db3/struct_l.html">L</a></div><div class="ttdef"><b>Definition:</b> list.h:8</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ac107a0b0233dacb9e8cd3a983d6740b6" name="ac107a0b0233dacb9e8cd3a983d6740b6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac107a0b0233dacb9e8cd3a983d6740b6">&#9670;&#160;</a></span>lcslen()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void lcslen </td>
<td>(</td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>s1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>s2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int **&#160;</td>
<td class="paramname"><em>L</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int **&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>@breif Computes LCS between s1 and s2 using a dynamic-programming approach </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">1</td><td>s1 first null-terminated string </td></tr>
<tr><td class="paramname">2</td><td>s2 second null-terminated string </td></tr>
<tr><td class="paramname">3</td><td>l1 length of s1 </td></tr>
<tr><td class="paramname">4</td><td>l2 length of s2 </td></tr>
<tr><td class="paramname">5</td><td><a class="el" href="../../df/db3/struct_l.html">L</a> matrix of size l1 x l2 </td></tr>
<tr><td class="paramname">6</td><td>B matrix of size l1 x l2 </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 27</span> {</div>
<div class="line"><span class="lineno"> 28</span> <span class="comment">/* B is the directions matrix</span></div>
<div class="line"><span class="lineno"> 29</span><span class="comment"> L is the LCS matrix */</span></div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">int</span> i, j;</div>
<div class="line"><span class="lineno"> 31</span> </div>
<div class="line"><span class="lineno"> 32</span> <span class="comment">/* loop over the simbols in my sequences</span></div>
<div class="line"><span class="lineno"> 33</span><span class="comment"> save the directions according to the LCS */</span></div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (i = 1; i &lt;= l1; ++i)</div>
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (j = 1; j &lt;= l2; ++j)</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">if</span> (s1[i-1] == s2[j-1]) {</div>
<div class="line"><span class="lineno"> 37</span> <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i][j] = 1 + <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i-1][j-1];</div>
<div class="line"><span class="lineno"> 38</span> B[i][j] = DIAG;</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i-1][j] &lt; <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i][j-1]) {</div>
<div class="line"><span class="lineno"> 41</span> <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i][j] = <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i][j-1];</div>
<div class="line"><span class="lineno"> 42</span> B[i][j] = LEFT;</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 45</span> <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i][j] = <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[i-1][j];</div>
<div class="line"><span class="lineno"> 46</span> B[i][j] = UP;</div>
<div class="line"><span class="lineno"> 47</span> }</div>
<div class="line"><span class="lineno"> 48</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
<tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 150</span> {</div>
<div class="line"><span class="lineno"> 151</span> <a class="code hl_function" href="../../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 153</span>}</div>
<div class="ttc" id="alcs_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> lcs.c:90</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de1/lcs_8c_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="268" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 90</span> {</div>
<div class="line"><span class="lineno"> 91</span> <span class="comment">/* https://en.wikipedia.org/wiki/Subsequence#Applications */</span></div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordtype">int</span> **<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>, **B, j, l1, l2;</div>
<div class="line"><span class="lineno"> 93</span> </div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordtype">char</span> *s1 = <span class="stringliteral">&quot;ACGGTGTCGTGCTATGCTGATGCTGACTTATATGCTA&quot;</span>;</div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordtype">char</span> *s2 = <span class="stringliteral">&quot;CGTTCGGCTATCGTACGTTCTATTCTATGATTTCTAA&quot;</span>;</div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">char</span> *lcs;</div>
<div class="line"><span class="lineno"> 97</span> </div>
<div class="line"><span class="lineno"> 98</span> l1 = strlen(s1);</div>
<div class="line"><span class="lineno"> 99</span> l2 = strlen(s2);</div>
<div class="line"><span class="lineno"> 100</span> </div>
<div class="line"><span class="lineno"> 101</span> <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a> = (<span class="keywordtype">int</span> **)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(l1+1, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span> *));</div>
<div class="line"><span class="lineno"> 102</span> B = (<span class="keywordtype">int</span> **)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(l1+1, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span> *));</div>
<div class="line"><span class="lineno"> 103</span> </div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">if</span> (!<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>) {</div>
<div class="line"><span class="lineno"> 105</span> perror(<span class="stringliteral">&quot;calloc: &quot;</span>);</div>
<div class="line"><span class="lineno"> 106</span> exit(1);</div>
<div class="line"><span class="lineno"> 107</span> }</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (!B) {</div>
<div class="line"><span class="lineno"> 109</span> perror(<span class="stringliteral">&quot;calloc: &quot;</span>);</div>
<div class="line"><span class="lineno"> 110</span> exit(1);</div>
<div class="line"><span class="lineno"> 111</span> }</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">for</span> (j = 0; j &lt;= l1; j++) {</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[j] = (<span class="keywordtype">int</span> *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(l2+1, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">if</span> (!<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[j]) {</div>
<div class="line"><span class="lineno"> 115</span> perror(<span class="stringliteral">&quot;calloc: &quot;</span>);</div>
<div class="line"><span class="lineno"> 116</span> exit(1);</div>
<div class="line"><span class="lineno"> 117</span> }</div>
<div class="line"><span class="lineno"> 118</span> B[j] = (<span class="keywordtype">int</span> *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(l2+1, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));</div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">if</span> (!<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[j]) {</div>
<div class="line"><span class="lineno"> 120</span> perror(<span class="stringliteral">&quot;calloc: &quot;</span>);</div>
<div class="line"><span class="lineno"> 121</span> exit(1);</div>
<div class="line"><span class="lineno"> 122</span> }</div>
<div class="line"><span class="lineno"> 123</span> }</div>
<div class="line"><span class="lineno"> 124</span> </div>
<div class="line"><span class="lineno"> 125</span> <a class="code hl_function" href="../../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6">lcslen</a>(s1, s2, l1, l2, <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>, B);</div>
<div class="line"><span class="lineno"> 126</span> lcs = <a class="code hl_function" href="../../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0">lcsbuild</a>(s1, l1, l2, <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>, B);</div>
<div class="line"><span class="lineno"> 127</span> </div>
<div class="line"><span class="lineno"> 128</span> assert(<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[l1][l2] == 27);</div>
<div class="line"><span class="lineno"> 129</span> assert(strcmp(lcs, <span class="stringliteral">&quot;CGTTCGGCTATGCTTCTACTTATTCTA&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 130</span> </div>
<div class="line"><span class="lineno"> 131</span> printf(<span class="stringliteral">&quot;S1: %s\tS2: %s\n&quot;</span>, s1, s2);</div>
<div class="line"><span class="lineno"> 132</span> printf(<span class="stringliteral">&quot;LCS len:%3d\n&quot;</span>, <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[l1][l2]);</div>
<div class="line"><span class="lineno"> 133</span> printf(<span class="stringliteral">&quot;LCS: %s\n&quot;</span>, lcs);</div>
<div class="line"><span class="lineno"> 134</span> </div>
<div class="line"><span class="lineno"> 135</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(lcs); </div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">for</span> (j = 0; j &lt;= l1; j++)</div>
<div class="line"><span class="lineno"> 137</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>[j]), <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(B[j]);</div>
<div class="line"><span class="lineno"> 138</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>);</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(B);</div>
<div class="line"><span class="lineno"> 140</span> </div>
<div class="line"><span class="lineno"> 141</span> printf(<span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 142</span>}</div>
<div class="ttc" id="alcs_8c_html_a741c9173a9fef243518f5c2352b81fc0"><div class="ttname"><a href="../../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0">lcsbuild</a></div><div class="ttdeci">char * lcsbuild(const char *s1, int l1, int l2, int **L, int **B)</div><div class="ttdoc">@breif Builds the LCS according to B using a traceback approach</div><div class="ttdef"><b>Definition:</b> lcs.c:59</div></div>
<div class="ttc" id="alcs_8c_html_ac107a0b0233dacb9e8cd3a983d6740b6"><div class="ttname"><a href="../../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6">lcslen</a></div><div class="ttdeci">void lcslen(const char *s1, const char *s2, int l1, int l2, int **L, int **B)</div><div class="ttdoc">@breif Computes LCS between s1 and s2 using a dynamic-programming approach</div><div class="ttdef"><b>Definition:</b> lcs.c:27</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a></div><div class="ttdeci">#define free(ptr)</div><div class="ttdoc">This macro replace the standard free function with free_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:26</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de1/lcs_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="170" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../db/de1/lcs_8c.html">lcs.c</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.5 </li>
</ul>
</div>
</body>
</html>

7
db/de1/lcs_8c.js Normal file
View File

@ -0,0 +1,7 @@
var lcs_8c =
[
[ "lcsbuild", "db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0", null ],
[ "lcslen", "db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6", null ],
[ "main", "db/de1/lcs_8c.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
[ "test", "db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

View File

@ -0,0 +1,6 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,31,56,56"/>
<area shape="rect" id="node2" href="$db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,31,148,56"/>
<area shape="rect" id="node3" href="$db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0" title="@breif Builds the LCS according to B using a traceback approach" alt="" coords="196,5,263,31"/>
<area shape="rect" id="node4" href="$db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6" title="@breif Computes LCS between s1 and s2 using a dynamic&#45;programming approach" alt="" coords="201,55,257,80"/>
</map>

View File

@ -0,0 +1 @@
6f3f9dfa107f08ce6a4553449a150e13

View File

@ -0,0 +1,66 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.0.4 (20221203.1631)
-->
<!-- Title: main Pages: 1 -->
<svg width="201pt" height="64pt"
viewBox="0.00 0.00 201.00 64.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="38,-37 0,-37 0,-18 38,-18 38,-37"/>
<text text-anchor="middle" x="19" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="107,-37 74,-37 74,-18 107,-18 107,-37"/>
<text text-anchor="middle" x="90.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M38.26,-27.5C45.72,-27.5 54.5,-27.5 62.66,-27.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.44,-31 72.44,-27.5 62.44,-24 62.44,-31"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0" target="_top" xlink:title="@breif Builds the LCS according to B using a traceback approach">
<polygon fill="white" stroke="#666666" points="193,-56 143,-56 143,-37 193,-37 193,-56"/>
<text text-anchor="middle" x="168" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">lcsbuild</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M107.14,-31.44C114.29,-33.24 123.07,-35.45 131.68,-37.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.73,-40.98 141.28,-40.03 132.44,-34.19 130.73,-40.98"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6" target="_top" xlink:title="@breif Computes LCS between s1 and s2 using a dynamic&#45;programming approach">
<polygon fill="white" stroke="#666666" points="189,-19 147,-19 147,0 189,0 189,-19"/>
<text text-anchor="middle" x="168" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">lcslen</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M107.14,-23.77C115.34,-21.82 125.68,-19.35 135.45,-17.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.11,-20.46 145.03,-14.74 134.49,-13.65 136.11,-20.46"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 3.0 KiB

View File

@ -0,0 +1,5 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
<area shape="rect" id="node2" href="$db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0" title="@breif Builds the LCS according to B using a traceback approach" alt="" coords="97,5,164,31"/>
<area shape="rect" id="node3" href="$db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6" title="@breif Computes LCS between s1 and s2 using a dynamic&#45;programming approach" alt="" coords="103,55,159,80"/>
</map>

View File

@ -0,0 +1 @@
6ad40ff4cb2627f0491bc779dcdf796b

View File

@ -0,0 +1,51 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.0.4 (20221203.1631)
-->
<!-- Title: test Pages: 1 -->
<svg width="127pt" height="64pt"
viewBox="0.00 0.00 127.00 64.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="33,-37 0,-37 0,-18 33,-18 33,-37"/>
<text text-anchor="middle" x="16.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0" target="_top" xlink:title="@breif Builds the LCS according to B using a traceback approach">
<polygon fill="white" stroke="#666666" points="119,-56 69,-56 69,-37 119,-37 119,-56"/>
<text text-anchor="middle" x="94" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">lcsbuild</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M33.14,-31.44C40.29,-33.24 49.07,-35.45 57.68,-37.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.73,-40.98 67.28,-40.03 58.44,-34.19 56.73,-40.98"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6" target="_top" xlink:title="@breif Computes LCS between s1 and s2 using a dynamic&#45;programming approach">
<polygon fill="white" stroke="#666666" points="115,-19 73,-19 73,0 115,0 115,-19"/>
<text text-anchor="middle" x="94" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">lcslen</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M33.14,-23.77C41.34,-21.82 51.68,-19.35 61.45,-17.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.11,-20.46 71.03,-14.74 60.49,-13.65 62.11,-20.46"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 2.3 KiB

View File

@ -116,41 +116,41 @@ Collaboration diagram for quaternion_:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:a8f4ba16bbebe066cfb2479c4db32427e"><td class="memItemLeft" ><a id="a8f4ba16bbebe066cfb2479c4db32427e" name="a8f4ba16bbebe066cfb2479c4db32427e"></a>
<tr class="memitem:a82153d57087d94923025e53fc6460b35"><td class="memItemLeft" ><a id="a82153d57087d94923025e53fc6460b35" name="a82153d57087d94923025e53fc6460b35"></a>
union {</td></tr>
<tr class="memitem:abf7117ed25aceacb13c85d411f09230a"><td class="memItemLeft" >
<tr class="memitem:a15cdc6da5002575851a26352f0538c4b"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>w</b></td></tr>
<tr class="memdesc:abf7117ed25aceacb13c85d411f09230a"><td class="mdescLeft">&#160;</td><td class="mdescRight">real part of quaternion <br /></td></tr>
<tr class="separator:abf7117ed25aceacb13c85d411f09230a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acc73033db5151e631425e111fe3a56b3"><td class="memItemLeft" >
<tr class="memdesc:a15cdc6da5002575851a26352f0538c4b"><td class="mdescLeft">&#160;</td><td class="mdescRight">real part of quaternion <br /></td></tr>
<tr class="separator:a15cdc6da5002575851a26352f0538c4b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abfc5ed33e39522935b0d63a55c28e8b7"><td class="memItemLeft" >
&#160;&#160;&#160;float&#160;&#160;&#160;<b>q0</b></td></tr>
<tr class="memdesc:acc73033db5151e631425e111fe3a56b3"><td class="mdescLeft">&#160;</td><td class="mdescRight">real part of quaternion <br /></td></tr>
<tr class="separator:acc73033db5151e631425e111fe3a56b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8f4ba16bbebe066cfb2479c4db32427e"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="memdesc:a8f4ba16bbebe066cfb2479c4db32427e"><td class="mdescLeft">&#160;</td><td class="mdescRight">dual part of quaternion <br /></td></tr>
<tr class="separator:a8f4ba16bbebe066cfb2479c4db32427e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2d66408dc698aaf4e2828dc13b0b5b4c"><td class="memItemLeft" ><a id="a2d66408dc698aaf4e2828dc13b0b5b4c" name="a2d66408dc698aaf4e2828dc13b0b5b4c"></a>
<tr class="memdesc:abfc5ed33e39522935b0d63a55c28e8b7"><td class="mdescLeft">&#160;</td><td class="mdescRight">real part of quaternion <br /></td></tr>
<tr class="separator:abfc5ed33e39522935b0d63a55c28e8b7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a82153d57087d94923025e53fc6460b35"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="memdesc:a82153d57087d94923025e53fc6460b35"><td class="mdescLeft">&#160;</td><td class="mdescRight">dual part of quaternion <br /></td></tr>
<tr class="separator:a82153d57087d94923025e53fc6460b35"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1b6e02ed8d1ee1a21c77c7dad7ece296"><td class="memItemLeft" ><a id="a1b6e02ed8d1ee1a21c77c7dad7ece296" name="a1b6e02ed8d1ee1a21c77c7dad7ece296"></a>
union {</td></tr>
<tr class="memitem:af66804aa3800c357db79722e8589e2b1"><td class="memItemLeft" >
<tr class="memitem:a9e169403f6950a80a706f664a9c782f8"><td class="memItemLeft" >
&#160;&#160;&#160;<a class="el" href="../../de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270">vec_3d</a>&#160;&#160;&#160;<b>dual</b></td></tr>
<tr class="memdesc:af66804aa3800c357db79722e8589e2b1"><td class="mdescLeft">&#160;</td><td class="mdescRight">can be a 3D vector <br /></td></tr>
<tr class="separator:af66804aa3800c357db79722e8589e2b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad5ea00d479ff5d121647ef390247adff"><td class="memItemLeft" ><a id="ad5ea00d479ff5d121647ef390247adff" name="ad5ea00d479ff5d121647ef390247adff"></a>
<tr class="memdesc:a9e169403f6950a80a706f664a9c782f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">can be a 3D vector <br /></td></tr>
<tr class="separator:a9e169403f6950a80a706f664a9c782f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a83eccd89fe3cff58547d63889d67ea82"><td class="memItemLeft" ><a id="a83eccd89fe3cff58547d63889d67ea82" name="a83eccd89fe3cff58547d63889d67ea82"></a>
&#160;&#160;&#160;struct {</td></tr>
<tr class="memitem:aef5c4def5b8aea694a16bb7761b703aa"><td class="memItemLeft" >
<tr class="memitem:a80137b5308ee0afe96798bc4e746bf0d"><td class="memItemLeft" >
&#160;&#160;&#160;&#160;&#160;&#160;float&#160;&#160;&#160;<b>q1</b></td></tr>
<tr class="separator:aef5c4def5b8aea694a16bb7761b703aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6a522d345c43487e07df732f7e91d17c"><td class="memItemLeft" >
<tr class="separator:a80137b5308ee0afe96798bc4e746bf0d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a89d35a6927cf27080f083c6f0a13de74"><td class="memItemLeft" >
&#160;&#160;&#160;&#160;&#160;&#160;float&#160;&#160;&#160;<b>q2</b></td></tr>
<tr class="separator:a6a522d345c43487e07df732f7e91d17c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a04270b6f015287ed3d1abafd447fff93"><td class="memItemLeft" >
<tr class="separator:a89d35a6927cf27080f083c6f0a13de74"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a895e45164c7224a8d236b770b1047ebf"><td class="memItemLeft" >
&#160;&#160;&#160;&#160;&#160;&#160;float&#160;&#160;&#160;<b>q3</b></td></tr>
<tr class="separator:a04270b6f015287ed3d1abafd447fff93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad5ea00d479ff5d121647ef390247adff"><td class="memItemLeft" valign="top">&#160;&#160;&#160;}&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="memdesc:ad5ea00d479ff5d121647ef390247adff"><td class="mdescLeft">&#160;</td><td class="mdescRight">or individual values <br /></td></tr>
<tr class="separator:ad5ea00d479ff5d121647ef390247adff"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2d66408dc698aaf4e2828dc13b0b5b4c"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a2d66408dc698aaf4e2828dc13b0b5b4c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="separator:a895e45164c7224a8d236b770b1047ebf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a83eccd89fe3cff58547d63889d67ea82"><td class="memItemLeft" valign="top">&#160;&#160;&#160;}&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="memdesc:a83eccd89fe3cff58547d63889d67ea82"><td class="mdescLeft">&#160;</td><td class="mdescRight">or individual values <br /></td></tr>
<tr class="separator:a83eccd89fe3cff58547d63889d67ea82"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1b6e02ed8d1ee1a21c77c7dad7ece296"><td class="memItemLeft" valign="top">};&#160;</td><td class="memItemRight" valign="bottom"></td></tr>
<tr class="separator:a1b6e02ed8d1ee1a21c77c7dad7ece296"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >a Quaternion type represented using a scalar \(w\) or \(q_0\) and a 3D vector \(\left(q_1,q_2,q_3\right)\) </p>

View File

@ -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_md71"></a>
<h1><a class="anchor" id="autotoc_md73"></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_md72"></a>
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md74"></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">
@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
<li>Doxygen documentation isn't used in LeetCode solutions. Simple/small documentation or comments should be fine.</li>
<li>Don't include libraries/headers such as <code>stdio.h</code>. Your file should be the solution to the problem only.</li>
</ol>
<h2><a class="anchor" id="autotoc_md73"></a>
<h2><a class="anchor" id="autotoc_md75"></a>
📜 Adding your new solution to the list 📜</h2>
<p >Great! You've added your solution. Now, you'll have to add it to <code>leetcode/DIRECTORY.md</code>.\ Please use numerical order. For example: if the solution's number is <code>98</code>, add your solution after <code>97</code>, if available.</p>
<p >This is the required format for new solutinos:</p>
<div class="fragment"><div class="line">| &lt;solution number&gt; | [&lt;solution name&gt;](&lt;leetcode link to problem&gt;) | [C](./src/&lt;filename&gt;.c) | &lt;difficulty&gt; |</div>
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md74"></a>
</div><!-- fragment --><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">

View File

@ -0,0 +1,120 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<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: dynamic_programming Directory Reference</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>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dir_8a20dd5bfd5341a725342bf72b6b686f.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">dynamic_programming Directory Reference</div></div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/de1/lcs_8c.html">lcs.c</a></td></tr>
<tr class="memdesc:db/de1/lcs_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" target="_blank">Longest Common Subsequence</a> algorithm <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.5 </li>
</ul>
</div>
</body>
</html>

View File

@ -0,0 +1,4 @@
var dir_8a20dd5bfd5341a725342bf72b6b686f =
[
[ "lcs.c", "db/de1/lcs_8c.html", "db/de1/lcs_8c" ]
];

View File

@ -160,150 +160,152 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_4_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/deb/min__printf_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d9/deb/min__printf_8h.html" target="_self">min_printf.h</a></td><td class="desc">Implementation of a <a href="https://www.geeksforgeeks.org/variable-length-argument-c" target="_blank">function</a> similar to <code>printf</code> </td></tr>
<tr id="row_4_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d11/test__malloc__dbg_8c.html" target="_self">test_malloc_dbg.c</a></td><td class="desc">File used to test the malloc_dbg, calloc_dbg and free_dbg functions </td></tr>
<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d5c/test__min__printf_8c.html" target="_self">test_min_printf.c</a></td><td class="desc">File used to test min_printf function </td></tr>
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9658;</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')">&#160;</span><a class="el" href="dir_48bf5503321d91c557399989fed5dabd.html" target="_self">exercism</a></td><td class="desc"></td></tr>
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_0_" class="arrow" onclick="toggleFolder('5_0_')">&#9658;</span><span id="img_5_0_" class="iconfclosed" onclick="toggleFolder('5_0_')">&#160;</span><a class="el" href="dir_fe5d69ed7d90cb356556070c2a2e5478.html" target="_self">acronym</a></td><td class="desc"></td></tr>
<tr id="row_5_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="df/dc6/acronym_8h_source.html"><span class="icondoc"></span></a><b>acronym.h</b></td><td class="desc"></td></tr>
<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_1_" class="arrow" onclick="toggleFolder('5_1_')">&#9658;</span><span id="img_5_1_" class="iconfclosed" onclick="toggleFolder('5_1_')">&#160;</span><a class="el" href="dir_4500de955d1eddb82f69331d96e39ed9.html" target="_self">hello_world</a></td><td class="desc"></td></tr>
<tr id="row_5_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="db/ddb/hello__world_8h_source.html"><span class="icondoc"></span></a><b>hello_world.h</b></td><td class="desc"></td></tr>
<tr id="row_5_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_2_" class="arrow" onclick="toggleFolder('5_2_')">&#9658;</span><span id="img_5_2_" class="iconfclosed" onclick="toggleFolder('5_2_')">&#160;</span><a class="el" href="dir_76784a7b04633629b9ecb5543b9ad889.html" target="_self">isogram</a></td><td class="desc"></td></tr>
<tr id="row_5_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d6/d48/isogram_8h_source.html"><span class="icondoc"></span></a><b>isogram.h</b></td><td class="desc"></td></tr>
<tr id="row_5_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_3_" class="arrow" onclick="toggleFolder('5_3_')">&#9658;</span><span id="img_5_3_" class="iconfclosed" onclick="toggleFolder('5_3_')">&#160;</span><a class="el" href="dir_81f43aa0067826ea5befe80cd7aefcc5.html" target="_self">rna_transcription</a></td><td class="desc"></td></tr>
<tr id="row_5_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d7/d90/rna__transcription_8h_source.html"><span class="icondoc"></span></a><b>rna_transcription.h</b></td><td class="desc"></td></tr>
<tr id="row_5_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_4_" class="arrow" onclick="toggleFolder('5_4_')">&#9658;</span><span id="img_5_4_" class="iconfclosed" onclick="toggleFolder('5_4_')">&#160;</span><a class="el" href="dir_475f56e0a4ef6254f5610544d8d68aa3.html" target="_self">word_count</a></td><td class="desc"></td></tr>
<tr id="row_5_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="dd/d95/word__count_8h_source.html"><span class="icondoc"></span></a><b>word_count.h</b></td><td class="desc"></td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">&#9658;</span><span id="img_6_" class="iconfclosed" onclick="toggleFolder('6_')">&#160;</span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/de2/naval__battle_8c.html" target="_self">naval_battle.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Battleship_(game)" target="_blank">naval_battle</a> implementation in C using only the stdio.h for Standard Input and Output </td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="toggleFolder('7_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dc7/geometry__datatypes_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d0/dc7/geometry__datatypes_8h.html" target="_self">geometry_datatypes.h</a></td><td class="desc">Generic header that provides data types for 3D vectors and quaternions </td></tr>
<tr id="row_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d98/quaternions_8c.html" target="_self">quaternions.c</a></td><td class="desc">Functions related to 3D quaternions and Euler angles </td></tr>
<tr id="row_7_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db8/vectors__3d_8c.html" target="_self">vectors_3d.c</a></td><td class="desc">Functions related to 3D vector operations </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9658;</span><span id="img_8_" class="iconfclosed" onclick="toggleFolder('8_')">&#160;</span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</a></td><td class="desc"></td></tr>
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d98/spirograph_8c.html" target="_self">spirograph.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
<tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9658;</span><span id="img_9_" class="iconfclosed" onclick="toggleFolder('9_')">&#160;</span><a class="el" href="dir_a4300992e825aa9b9238bf43160a241e.html" target="_self">greedy_approach</a></td><td class="desc"></td></tr>
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dcc/prim_8c.html" target="_self">prim.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Prim%27s_algorithm" target="_blank">Prim's algorithm</a> implementation in C to find the MST of a weighted, connected graph </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9658;</span><span id="img_10_" class="iconfclosed" onclick="toggleFolder('10_')">&#160;</span><a class="el" href="dir_72aaf47615111200018c039a56ef48be.html" target="_self">hash</a></td><td class="desc"></td></tr>
<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d39/hash__adler32_8c.html" target="_self">hash_adler32.c</a></td><td class="desc">32-bit <a href="https://en.wikipedia.org/wiki/Adler-32" target="_blank">Adler hash</a> algorithm </td></tr>
<tr id="row_10_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dc9/hash__crc32_8c.html" target="_self">hash_crc32.c</a></td><td class="desc">32-bit <a href="https://en.wikipedia.org/wiki/Cyclic_redundancy_check#CRC-32_algorithm" target="_blank">CRC hash</a> algorithm </td></tr>
<tr id="row_10_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/de3/hash__djb2_8c.html" target="_self">hash_djb2.c</a></td><td class="desc"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">DJB2 hash algorithm</a> </td></tr>
<tr id="row_10_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d0c/hash__sdbm_8c.html" target="_self">hash_sdbm.c</a></td><td class="desc"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">SDBM hash algorithm</a> </td></tr>
<tr id="row_10_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d57/hash__xor8_8c.html" target="_self">hash_xor8.c</a></td><td class="desc">8-bit <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR hash</a> algorithm for ASCII characters </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9658;</span><span id="img_11_" class="iconfclosed" onclick="toggleFolder('11_')">&#160;</span><a class="el" href="dir_03902f230b9e9b7c999f936617a23997.html" target="_self">leetcode</a></td><td class="desc"></td></tr>
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_0_" class="arrow" onclick="toggleFolder('11_0_')">&#9658;</span><span id="img_11_0_" class="iconfclosed" onclick="toggleFolder('11_0_')">&#160;</span><a class="el" href="dir_614f310c248f2b9541b559085cafcb40.html" target="_self">src</a></td><td class="desc"></td></tr>
<tr id="row_11_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/df3/6_8c.html" target="_self">6.c</a></td><td class="desc">Implementation of the <a href="https://leetcode.com/problems/zigzag-conversion/" target="_blank">ZigZag Conversion</a> Leetcode problem </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9658;</span><span id="img_12_" class="iconfclosed" onclick="toggleFolder('12_')">&#160;</span><a class="el" href="dir_3343723ae086de42ee4ca9774da3a13f.html" target="_self">machine_learning</a></td><td class="desc"></td></tr>
<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d8c/adaline__learning_8c.html" target="_self">adaline_learning.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation </td></tr>
<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d76/k__means__clustering_8c.html" target="_self">k_means_clustering.c</a></td><td class="desc">K Means Clustering Algorithm implemented </td></tr>
<tr id="row_12_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/df6/kohonen__som__topology_8c.html" target="_self">kohonen_som_topology.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) </td></tr>
<tr id="row_12_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d46/kohonen__som__trace_8c.html" target="_self">kohonen_som_trace.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) </td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9658;</span><span id="img_13_" class="iconfclosed" onclick="toggleFolder('13_')">&#160;</span><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html" target="_self">math</a></td><td class="desc"></td></tr>
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d80/cantor__set_8c.html" target="_self">cantor_set.c</a></td><td class="desc">Program to generate <a href="https://en.wikipedia.org/wiki/Cantor_set" target="_blank">Cantor ternary set</a> </td></tr>
<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2e/cartesian__to__polar_8c.html" target="_self">cartesian_to_polar.c</a></td><td class="desc">Function to convert a Cartesian co-ordinate to polar form </td></tr>
<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d80/collatz_8c.html" target="_self">collatz.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Collatz_conjecture" target="_blank">Collatz' conjecture</a> </td></tr>
<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d3d/factorial__large__number_8c.html" target="_self">factorial_large_number.c</a></td><td class="desc">Compute factorial of arbitrarily large numbers by storing individual digits in a byte </td></tr>
<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d99/fibonacci__fast_8c.html" target="_self">fibonacci_fast.c</a></td><td class="desc">Compute \(m^{mth}\) Fibonacci number using the formulae: </td></tr>
<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d75/fibonacci__formula_8c.html" target="_self">fibonacci_formula.c</a></td><td class="desc">Finding Fibonacci number of any <code>n</code> number using [Binet's closed form formula](<a href="https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula">https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula</a>) compute \(f_{nth}\) Fibonacci number using the binet's formula: Fn = 1√5 * (1+√5 / 2)^n+1 1√5 * (1√5 / 2)^n+1 </td></tr>
<tr id="row_13_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d16/palindrome_8c.html" target="_self">palindrome.c</a></td><td class="desc">Program to identify if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome number</a> or not </td></tr>
<tr id="row_13_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d93/prime_8c.html" target="_self">prime.c</a></td><td class="desc">Program to identify if a number is <a href="https://en.wikipedia.org/wiki/Prime_number" target="_blank">prime number</a> or not </td></tr>
<tr id="row_13_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/dd3/prime__sieve_8c.html" target="_self">prime_sieve.c</a></td><td class="desc"><a href="https://leetcode.com/problems/count-primes/" target="_blank">Prime Sieve</a> algorithm implementation </td></tr>
<tr id="row_13_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dcc/strong__number_8c.html" target="_self">strong_number.c</a></td><td class="desc">Strong number is a number whose sum of all digits factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120) </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9658;</span><span id="img_14_" class="iconfclosed" onclick="toggleFolder('14_')">&#160;</span><a class="el" href="dir_a52f4d3d586a58b02f3a4ddf0a992157.html" target="_self">misc</a></td><td class="desc"></td></tr>
<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/dcb/poly__add_8c.html" target="_self">poly_add.c</a></td><td class="desc">Implementation of [Addition of two polynomials] (<a href="https://en.wikipedia.org/wiki/Polynomial#Addition">https://en.wikipedia.org/wiki/Polynomial#Addition</a>) </td></tr>
<tr id="row_14_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d43/postfix__evaluation_8c.html" target="_self">postfix_evaluation.c</a></td><td class="desc"><a href="https://www.includehelp.com/c/evaluation-of-postfix-expressions-using-stack-with-c-program.aspx" target="_blank">Postfix evaluation algorithm</a> implementation </td></tr>
<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/rot13_8c.html" target="_self">rot13.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ROT13" target="_blank">ROT13</a> is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the alphabet </td></tr>
<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc7/run__length__encoding_8c.html" target="_self">run_length_encoding.c</a></td><td class="desc">Encode a null terminated string using <a href="https://en.wikipedia.org/wiki/Run-length_encoding" target="_blank">Run-length encoding</a> </td></tr>
<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dac/sudoku__solver_8c.html" target="_self">sudoku_solver.c</a></td><td class="desc">Sudoku Solver using recursive implementation of brute-force algorithm </td></tr>
<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/df3/union__find_8c.html" target="_self">union_find.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Union find</a> algorithm </td></tr>
<tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9658;</span><span id="img_15_" class="iconfclosed" onclick="toggleFolder('15_')">&#160;</span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d38/durand__kerner__roots_8c.html" target="_self">durand_kerner_roots.c</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d2e/lu__decompose_8c.html" target="_self">lu_decompose.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </td></tr>
<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d08/newton__raphson__root_8c.html" target="_self">newton_raphson_root.c</a></td><td class="desc">Find approximate solution for \(f(x) = 0\) using Newton-Raphson interpolation algorithm </td></tr>
<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d07/ode__forward__euler_8c.html" target="_self">ode_forward_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> </td></tr>
<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc2/ode__midpoint__euler_8c.html" target="_self">ode_midpoint_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> </td></tr>
<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html" target="_self">ode_semi_implicit_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> </td></tr>
<tr id="row_15_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_15_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d23/qr__decomposition_8c.html" target="_self">qr_decomposition.c</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_15_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d50/qr__eigen__values_8c.html" target="_self">qr_eigen_values.c</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method </td></tr>
<tr id="row_15_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d47/realtime__stats_8c.html" target="_self">realtime_stats.c</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">&#9658;</span><span id="img_16_" class="iconfclosed" onclick="toggleFolder('16_')">&#160;</span><a class="el" href="dir_63185e90e67935ef3eb5903a044c89e2.html" target="_self">process_scheduling_algorithms</a></td><td class="desc"></td></tr>
<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html" target="_self">non_preemptive_priority_scheduling.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Scheduling_(computing)" target="_blank">Non-Preemptive Priority Scheduling</a> is a scheduling algorithm that selects the tasks to execute based on priority </td></tr>
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_17_" class="arrow" onclick="toggleFolder('17_')">&#9658;</span><span id="img_17_" class="iconfclosed" onclick="toggleFolder('17_')">&#160;</span><a class="el" href="dir_b3d331eabd4234f247030c297aaf021c.html" target="_self">project_euler</a></td><td class="desc"></td></tr>
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_0_" class="arrow" onclick="toggleFolder('17_0_')">&#9658;</span><span id="img_17_0_" class="iconfclosed" onclick="toggleFolder('17_0_')">&#160;</span><a class="el" href="dir_8c6743d405e8ed13cc39f42e382307fd.html" target="_self">problem_1</a></td><td class="desc"></td></tr>
<tr id="row_17_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d35/problem__1_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_17_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/dae/problem__1_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_17_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d56/problem__1_2sol3_8c.html" target="_self">sol3.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_17_0_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d1b/sol4_8c.html" target="_self">sol4.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_17_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_1_" class="arrow" onclick="toggleFolder('17_1_')">&#9658;</span><span id="img_17_1_" class="iconfclosed" onclick="toggleFolder('17_1_')">&#160;</span><a class="el" href="dir_16b947d8e9a05fe119d0675493324331.html" target="_self">problem_10</a></td><td class="desc"></td></tr>
<tr id="row_17_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6d/problem__10_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=10" target="_blank">Problem 10</a> solution </td></tr>
<tr id="row_17_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/da7/problem__10_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=10" target="_blank">Problem 10</a> solution </td></tr>
<tr id="row_17_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_2_" class="arrow" onclick="toggleFolder('17_2_')">&#9658;</span><span id="img_17_2_" class="iconfclosed" onclick="toggleFolder('17_2_')">&#160;</span><a class="el" href="dir_d9112ab06cf4d4e5a25d385a268d1949.html" target="_self">problem_12</a></td><td class="desc"></td></tr>
<tr id="row_17_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d1f/problem__12_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=12" target="_blank">Problem 12</a> solution </td></tr>
<tr id="row_17_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_3_" class="arrow" onclick="toggleFolder('17_3_')">&#9658;</span><span id="img_17_3_" class="iconfclosed" onclick="toggleFolder('17_3_')">&#160;</span><a class="el" href="dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html" target="_self">problem_13</a></td><td class="desc"></td></tr>
<tr id="row_17_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d01/problem__13_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=13" target="_blank">Problem 13</a> solution </td></tr>
<tr id="row_17_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_4_" class="arrow" onclick="toggleFolder('17_4_')">&#9658;</span><span id="img_17_4_" class="iconfclosed" onclick="toggleFolder('17_4_')">&#160;</span><a class="el" href="dir_aba97bf327db94061e830e9bc18e925d.html" target="_self">problem_14</a></td><td class="desc"></td></tr>
<tr id="row_17_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dea/problem__14_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=14" target="_blank">Problem 14</a> solution </td></tr>
<tr id="row_17_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_5_" class="arrow" onclick="toggleFolder('17_5_')">&#9658;</span><span id="img_17_5_" class="iconfclosed" onclick="toggleFolder('17_5_')">&#160;</span><a class="el" href="dir_2b14f32f14b51065d3a322bea21da3c0.html" target="_self">problem_15</a></td><td class="desc"></td></tr>
<tr id="row_17_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d91/problem__15_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=15" target="_blank">Problem 15</a> solution </td></tr>
<tr id="row_17_6_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_6_" class="arrow" onclick="toggleFolder('17_6_')">&#9658;</span><span id="img_17_6_" class="iconfclosed" onclick="toggleFolder('17_6_')">&#160;</span><a class="el" href="dir_18cba55772148686552805a354a79093.html" target="_self">problem_16</a></td><td class="desc"></td></tr>
<tr id="row_17_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d88/problem__16_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=16" target="_blank">Problem 16</a> solution </td></tr>
<tr id="row_17_7_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_7_" class="arrow" onclick="toggleFolder('17_7_')">&#9658;</span><span id="img_17_7_" class="iconfclosed" onclick="toggleFolder('17_7_')">&#160;</span><a class="el" href="dir_0bc3e2a5baf077fa21dadc079776fcac.html" target="_self">problem_19</a></td><td class="desc"></td></tr>
<tr id="row_17_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/df0/problem__19_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=19" target="_blank">Problem 19</a> solution </td></tr>
<tr id="row_17_8_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_8_" class="arrow" onclick="toggleFolder('17_8_')">&#9658;</span><span id="img_17_8_" class="iconfclosed" onclick="toggleFolder('17_8_')">&#160;</span><a class="el" href="dir_eeeea13e3a5e5edad3499183767ce312.html" target="_self">problem_2</a></td><td class="desc"></td></tr>
<tr id="row_17_8_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d7f/so1_8c.html" target="_self">so1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=2" target="_blank">Problem 2</a> solution </td></tr>
<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_9_" class="arrow" onclick="toggleFolder('17_9_')">&#9658;</span><span id="img_17_9_" class="iconfclosed" onclick="toggleFolder('17_9_')">&#160;</span><a class="el" href="dir_4991c92e00761dd3d764efa2906b4318.html" target="_self">problem_20</a></td><td class="desc"></td></tr>
<tr id="row_17_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/problem__20_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=20" target="_blank">Problem 20</a> solution </td></tr>
<tr id="row_17_10_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_10_" class="arrow" onclick="toggleFolder('17_10_')">&#9658;</span><span id="img_17_10_" class="iconfclosed" onclick="toggleFolder('17_10_')">&#160;</span><a class="el" href="dir_d9e100c82ada2163abea49688a71e81c.html" target="_self">problem_21</a></td><td class="desc"></td></tr>
<tr id="row_17_10_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d1a/problem__21_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=21" target="_blank">Problem 21</a> solution </td></tr>
<tr id="row_17_11_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_11_" class="arrow" onclick="toggleFolder('17_11_')">&#9658;</span><span id="img_17_11_" class="iconfclosed" onclick="toggleFolder('17_11_')">&#160;</span><a class="el" href="dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html" target="_self">problem_22</a></td><td class="desc"></td></tr>
<tr id="row_17_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d8b/problem__22_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=22" target="_blank">Problem 22</a> solution </td></tr>
<tr id="row_17_12_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_12_" class="arrow" onclick="toggleFolder('17_12_')">&#9658;</span><span id="img_17_12_" class="iconfclosed" onclick="toggleFolder('17_12_')">&#160;</span><a class="el" href="dir_f75ccd45e00436eafed446b9b2682984.html" target="_self">problem_23</a></td><td class="desc"></td></tr>
<tr id="row_17_12_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/ddb/problem__23_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution </td></tr>
<tr id="row_17_12_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dbd/problem__23_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution - optimization using look-up array </td></tr>
<tr id="row_17_13_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_13_" class="arrow" onclick="toggleFolder('17_13_')">&#9658;</span><span id="img_17_13_" class="iconfclosed" onclick="toggleFolder('17_13_')">&#160;</span><a class="el" href="dir_079e1f799fb08a8a0b98cb030ab15687.html" target="_self">problem_25</a></td><td class="desc"></td></tr>
<tr id="row_17_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d32/problem__25_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=25" target="_blank">Problem 25</a> solution implemented using arbitrarily large numbers represented as arrays </td></tr>
<tr id="row_17_14_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_14_" class="arrow" onclick="toggleFolder('17_14_')">&#9658;</span><span id="img_17_14_" class="iconfclosed" onclick="toggleFolder('17_14_')">&#160;</span><a class="el" href="dir_16e00c78ef36d1842d0d8a4afc46b852.html" target="_self">problem_26</a></td><td class="desc"></td></tr>
<tr id="row_17_14_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/df9/problem__26_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=26" target="_blank">Problem 26</a> solution </td></tr>
<tr id="row_17_15_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_15_" class="arrow" onclick="toggleFolder('17_15_')">&#9658;</span><span id="img_17_15_" class="iconfclosed" onclick="toggleFolder('17_15_')">&#160;</span><a class="el" href="dir_b2dbfa46230fd9f775c32c1836ed3764.html" target="_self">problem_3</a></td><td class="desc"></td></tr>
<tr id="row_17_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/dd3/problem__3_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=3" target="_blank">Problem 3</a> solution </td></tr>
<tr id="row_17_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/dbc/problem__3_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=3" target="_blank">Problem 3</a> solution </td></tr>
<tr id="row_17_16_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_16_" class="arrow" onclick="toggleFolder('17_16_')">&#9658;</span><span id="img_17_16_" class="iconfclosed" onclick="toggleFolder('17_16_')">&#160;</span><a class="el" href="dir_1833eb69ceee7a265ffba4c38c8243d2.html" target="_self">problem_4</a></td><td class="desc"></td></tr>
<tr id="row_17_16_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6c/problem__4_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=4" target="_blank">Problem 4</a> solution </td></tr>
<tr id="row_17_17_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_17_" class="arrow" onclick="toggleFolder('17_17_')">&#9658;</span><span id="img_17_17_" class="iconfclosed" onclick="toggleFolder('17_17_')">&#160;</span><a class="el" href="dir_2f070f19f76dfadabbc24fe483d7e98d.html" target="_self">problem_401</a></td><td class="desc"></td></tr>
<tr id="row_17_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d83/problem__401_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=401" target="_blank">Problem 401</a> solution - Sum of squares of divisors </td></tr>
<tr id="row_17_18_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_18_" class="arrow" onclick="toggleFolder('17_18_')">&#9658;</span><span id="img_17_18_" class="iconfclosed" onclick="toggleFolder('17_18_')">&#160;</span><a class="el" href="dir_607f15d36c772334f988bb9ef82d102c.html" target="_self">problem_5</a></td><td class="desc"></td></tr>
<tr id="row_17_18_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d32/problem__5_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution - Naive algorithm (slowest) </td></tr>
<tr id="row_17_18_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d3d/problem__5_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution - Naive algorithm (Improved over <a class="el" href="dc/d32/problem__5_2sol1_8c.html" title="Problem 5 solution - Naive algorithm (slowest)">problem_5/sol1.c</a>) </td></tr>
<tr id="row_17_18_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d7c/problem__5_2sol3_8c.html" target="_self">sol3.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution (Fastest) </td></tr>
<tr id="row_17_19_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_19_" class="arrow" onclick="toggleFolder('17_19_')">&#9658;</span><span id="img_17_19_" class="iconfclosed" onclick="toggleFolder('17_19_')">&#160;</span><a class="el" href="dir_167af11096b7752ff31b3d4bec489317.html" target="_self">problem_6</a></td><td class="desc"></td></tr>
<tr id="row_17_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d7b/problem__6_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=6" target="_blank">Problem 6</a> solution </td></tr>
<tr id="row_17_20_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_20_" class="arrow" onclick="toggleFolder('17_20_')">&#9658;</span><span id="img_17_20_" class="iconfclosed" onclick="toggleFolder('17_20_')">&#160;</span><a class="el" href="dir_4bae997a2671812c2140d5abfb6305a4.html" target="_self">problem_7</a></td><td class="desc"></td></tr>
<tr id="row_17_20_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d2f/problem__7_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=7" target="_blank">Problem 7</a> solution </td></tr>
<tr id="row_17_20_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d64/problem__7_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=7" target="_blank">Problem 7</a> solution </td></tr>
<tr id="row_17_21_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_21_" class="arrow" onclick="toggleFolder('17_21_')">&#9658;</span><span id="img_17_21_" class="iconfclosed" onclick="toggleFolder('17_21_')">&#160;</span><a class="el" href="dir_4a15c8553efb9e59e3f1091cc0d3a27d.html" target="_self">problem_8</a></td><td class="desc"></td></tr>
<tr id="row_17_21_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d63/problem__8_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=8" target="_blank">Problem 8</a> solution </td></tr>
<tr id="row_17_21_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d93/problem__8_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=8" target="_blank">Problem 8</a> solution </td></tr>
<tr id="row_17_22_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_17_22_" class="arrow" onclick="toggleFolder('17_22_')">&#9658;</span><span id="img_17_22_" class="iconfclosed" onclick="toggleFolder('17_22_')">&#160;</span><a class="el" href="dir_d4c35186c199e728d69dee6bf5b2473c.html" target="_self">problem_9</a></td><td class="desc"></td></tr>
<tr id="row_17_22_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/da5/problem__9_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9" target="_blank">Problem 9</a> solution - A naive implementation </td></tr>
<tr id="row_17_22_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/de0/problem__9_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9" target="_blank">Problem 9</a> solution </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="toggleFolder('18_')">&#9658;</span><span id="img_18_" class="iconfclosed" onclick="toggleFolder('18_')">&#160;</span><a class="el" href="dir_da574daf9ce9c05b45556bdc871ed1e3.html" target="_self">searching</a></td><td class="desc"></td></tr>
<tr id="row_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d3b/binary__search_8c.html" target="_self">binary_search.c</a></td><td class="desc">Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm" target="_blank">binary search</a> of a target value in a given <em>sorted</em> array </td></tr>
<tr id="row_18_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d6c/exponential__search_8c.html" target="_self">exponential_search.c</a></td><td class="desc"><a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Exponential%20Search.md" target="_blank">Exponential Search</a> </td></tr>
<tr id="row_18_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html" target="_self">floyd_cycle_detection_algorithm.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
<tr id="row_18_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d7b/jump__search_8c.html" target="_self">jump_search.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">jump search</a> algorithm </td></tr>
<tr id="row_18_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d47/modified__binary__search_8c.html" target="_self">modified_binary_search.c</a></td><td class="desc"><a href="https://arxiv.org/abs/1406.1677" target="_blank">Modified binary search algorithm</a> </td></tr>
<tr id="row_18_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/de2/sentinel__linear__search_8c.html" target="_self">sentinel_linear_search.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search#With_a_sentinel" target="_blank">Linear Search with Sentinel</a> algorithm implementation </td></tr>
<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="toggleFolder('19_')">&#9658;</span><span id="img_19_" class="iconfclosed" onclick="toggleFolder('19_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
<tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/da8/bead__sort_8c.html" target="_self">bead_sort.c</a></td><td class="desc">Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort" target="_blank">bead sort</a> </td></tr>
<tr id="row_19_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/de4/bubble__sort_8c.html" target="_self">bubble_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm implementation </td></tr>
<tr id="row_19_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d6d/bubble__sort__2_8c.html" target="_self">bubble_sort_2.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm </td></tr>
<tr id="row_19_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d38/bubble__sort__recursion_8c.html" target="_self">bubble_sort_recursion.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm implementation using recursion </td></tr>
<tr id="row_19_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dff/heap__sort__2_8c.html" target="_self">heap_sort_2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort</a> implementation </td></tr>
<tr id="row_19_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/ddf/insertion__sort_8c.html" target="_self">insertion_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_19_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d0c/insertion__sort__recursive_8c.html" target="_self">insertion_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_19_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d83/merge__sort_8c.html" target="_self">merge_sort.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">merge sort</a> algorithm </td></tr>
<tr id="row_19_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d94/odd__even__sort_8c.html" target="_self">odd_even_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort" target="_blank">Odd Even Sort</a> implementation </td></tr>
<tr id="row_19_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d83/selection__sort_8c.html" target="_self">selection_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> algorithm implementation </td></tr>
<tr id="row_19_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d39/selection__sort__recursive_8c.html" target="_self">selection_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection Sort</a> implementation using recursion </td></tr>
<tr id="row_19_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort algorithm</a> implementation </td></tr>
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9658;</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')">&#160;</span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/de1/lcs_8c.html" target="_self">lcs.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" target="_blank">Longest Common Subsequence</a> algorithm </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">&#9658;</span><span id="img_6_" class="iconfclosed" onclick="toggleFolder('6_')">&#160;</span><a class="el" href="dir_48bf5503321d91c557399989fed5dabd.html" target="_self">exercism</a></td><td class="desc"></td></tr>
<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_6_0_" class="arrow" onclick="toggleFolder('6_0_')">&#9658;</span><span id="img_6_0_" class="iconfclosed" onclick="toggleFolder('6_0_')">&#160;</span><a class="el" href="dir_fe5d69ed7d90cb356556070c2a2e5478.html" target="_self">acronym</a></td><td class="desc"></td></tr>
<tr id="row_6_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="df/dc6/acronym_8h_source.html"><span class="icondoc"></span></a><b>acronym.h</b></td><td class="desc"></td></tr>
<tr id="row_6_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_6_1_" class="arrow" onclick="toggleFolder('6_1_')">&#9658;</span><span id="img_6_1_" class="iconfclosed" onclick="toggleFolder('6_1_')">&#160;</span><a class="el" href="dir_4500de955d1eddb82f69331d96e39ed9.html" target="_self">hello_world</a></td><td class="desc"></td></tr>
<tr id="row_6_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="db/ddb/hello__world_8h_source.html"><span class="icondoc"></span></a><b>hello_world.h</b></td><td class="desc"></td></tr>
<tr id="row_6_2_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_6_2_" class="arrow" onclick="toggleFolder('6_2_')">&#9658;</span><span id="img_6_2_" class="iconfclosed" onclick="toggleFolder('6_2_')">&#160;</span><a class="el" href="dir_76784a7b04633629b9ecb5543b9ad889.html" target="_self">isogram</a></td><td class="desc"></td></tr>
<tr id="row_6_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d6/d48/isogram_8h_source.html"><span class="icondoc"></span></a><b>isogram.h</b></td><td class="desc"></td></tr>
<tr id="row_6_3_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_6_3_" class="arrow" onclick="toggleFolder('6_3_')">&#9658;</span><span id="img_6_3_" class="iconfclosed" onclick="toggleFolder('6_3_')">&#160;</span><a class="el" href="dir_81f43aa0067826ea5befe80cd7aefcc5.html" target="_self">rna_transcription</a></td><td class="desc"></td></tr>
<tr id="row_6_3_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d7/d90/rna__transcription_8h_source.html"><span class="icondoc"></span></a><b>rna_transcription.h</b></td><td class="desc"></td></tr>
<tr id="row_6_4_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_6_4_" class="arrow" onclick="toggleFolder('6_4_')">&#9658;</span><span id="img_6_4_" class="iconfclosed" onclick="toggleFolder('6_4_')">&#160;</span><a class="el" href="dir_475f56e0a4ef6254f5610544d8d68aa3.html" target="_self">word_count</a></td><td class="desc"></td></tr>
<tr id="row_6_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="dd/d95/word__count_8h_source.html"><span class="icondoc"></span></a><b>word_count.h</b></td><td class="desc"></td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="toggleFolder('7_')">&#160;</span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/de2/naval__battle_8c.html" target="_self">naval_battle.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Battleship_(game)" target="_blank">naval_battle</a> implementation in C using only the stdio.h for Standard Input and Output </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9658;</span><span id="img_8_" class="iconfclosed" onclick="toggleFolder('8_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dc7/geometry__datatypes_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d0/dc7/geometry__datatypes_8h.html" target="_self">geometry_datatypes.h</a></td><td class="desc">Generic header that provides data types for 3D vectors and quaternions </td></tr>
<tr id="row_8_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d98/quaternions_8c.html" target="_self">quaternions.c</a></td><td class="desc">Functions related to 3D quaternions and Euler angles </td></tr>
<tr id="row_8_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db8/vectors__3d_8c.html" target="_self">vectors_3d.c</a></td><td class="desc">Functions related to 3D vector operations </td></tr>
<tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9658;</span><span id="img_9_" class="iconfclosed" onclick="toggleFolder('9_')">&#160;</span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</a></td><td class="desc"></td></tr>
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d98/spirograph_8c.html" target="_self">spirograph.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9658;</span><span id="img_10_" class="iconfclosed" onclick="toggleFolder('10_')">&#160;</span><a class="el" href="dir_a4300992e825aa9b9238bf43160a241e.html" target="_self">greedy_approach</a></td><td class="desc"></td></tr>
<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dcc/prim_8c.html" target="_self">prim.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Prim%27s_algorithm" target="_blank">Prim's algorithm</a> implementation in C to find the MST of a weighted, connected graph </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9658;</span><span id="img_11_" class="iconfclosed" onclick="toggleFolder('11_')">&#160;</span><a class="el" href="dir_72aaf47615111200018c039a56ef48be.html" target="_self">hash</a></td><td class="desc"></td></tr>
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d39/hash__adler32_8c.html" target="_self">hash_adler32.c</a></td><td class="desc">32-bit <a href="https://en.wikipedia.org/wiki/Adler-32" target="_blank">Adler hash</a> algorithm </td></tr>
<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dc9/hash__crc32_8c.html" target="_self">hash_crc32.c</a></td><td class="desc">32-bit <a href="https://en.wikipedia.org/wiki/Cyclic_redundancy_check#CRC-32_algorithm" target="_blank">CRC hash</a> algorithm </td></tr>
<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/de3/hash__djb2_8c.html" target="_self">hash_djb2.c</a></td><td class="desc"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">DJB2 hash algorithm</a> </td></tr>
<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d0c/hash__sdbm_8c.html" target="_self">hash_sdbm.c</a></td><td class="desc"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">SDBM hash algorithm</a> </td></tr>
<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d57/hash__xor8_8c.html" target="_self">hash_xor8.c</a></td><td class="desc">8-bit <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR hash</a> algorithm for ASCII characters </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9658;</span><span id="img_12_" class="iconfclosed" onclick="toggleFolder('12_')">&#160;</span><a class="el" href="dir_03902f230b9e9b7c999f936617a23997.html" target="_self">leetcode</a></td><td class="desc"></td></tr>
<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">&#9658;</span><span id="img_12_0_" class="iconfclosed" onclick="toggleFolder('12_0_')">&#160;</span><a class="el" href="dir_614f310c248f2b9541b559085cafcb40.html" target="_self">src</a></td><td class="desc"></td></tr>
<tr id="row_12_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/df3/6_8c.html" target="_self">6.c</a></td><td class="desc">Implementation of the <a href="https://leetcode.com/problems/zigzag-conversion/" target="_blank">ZigZag Conversion</a> Leetcode problem </td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9658;</span><span id="img_13_" class="iconfclosed" onclick="toggleFolder('13_')">&#160;</span><a class="el" href="dir_3343723ae086de42ee4ca9774da3a13f.html" target="_self">machine_learning</a></td><td class="desc"></td></tr>
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d8c/adaline__learning_8c.html" target="_self">adaline_learning.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation </td></tr>
<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d76/k__means__clustering_8c.html" target="_self">k_means_clustering.c</a></td><td class="desc">K Means Clustering Algorithm implemented </td></tr>
<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/df6/kohonen__som__topology_8c.html" target="_self">kohonen_som_topology.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) </td></tr>
<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d46/kohonen__som__trace_8c.html" target="_self">kohonen_som_trace.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9658;</span><span id="img_14_" class="iconfclosed" onclick="toggleFolder('14_')">&#160;</span><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html" target="_self">math</a></td><td class="desc"></td></tr>
<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d80/cantor__set_8c.html" target="_self">cantor_set.c</a></td><td class="desc">Program to generate <a href="https://en.wikipedia.org/wiki/Cantor_set" target="_blank">Cantor ternary set</a> </td></tr>
<tr id="row_14_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2e/cartesian__to__polar_8c.html" target="_self">cartesian_to_polar.c</a></td><td class="desc">Function to convert a Cartesian co-ordinate to polar form </td></tr>
<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d80/collatz_8c.html" target="_self">collatz.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Collatz_conjecture" target="_blank">Collatz' conjecture</a> </td></tr>
<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d3d/factorial__large__number_8c.html" target="_self">factorial_large_number.c</a></td><td class="desc">Compute factorial of arbitrarily large numbers by storing individual digits in a byte </td></tr>
<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d99/fibonacci__fast_8c.html" target="_self">fibonacci_fast.c</a></td><td class="desc">Compute \(m^{mth}\) Fibonacci number using the formulae: </td></tr>
<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d75/fibonacci__formula_8c.html" target="_self">fibonacci_formula.c</a></td><td class="desc">Finding Fibonacci number of any <code>n</code> number using [Binet's closed form formula](<a href="https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula">https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula</a>) compute \(f_{nth}\) Fibonacci number using the binet's formula: Fn = 1√5 * (1+√5 / 2)^n+1 1√5 * (1√5 / 2)^n+1 </td></tr>
<tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d16/palindrome_8c.html" target="_self">palindrome.c</a></td><td class="desc">Program to identify if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome number</a> or not </td></tr>
<tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d93/prime_8c.html" target="_self">prime.c</a></td><td class="desc">Program to identify if a number is <a href="https://en.wikipedia.org/wiki/Prime_number" target="_blank">prime number</a> or not </td></tr>
<tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/dd3/prime__sieve_8c.html" target="_self">prime_sieve.c</a></td><td class="desc"><a href="https://leetcode.com/problems/count-primes/" target="_blank">Prime Sieve</a> algorithm implementation </td></tr>
<tr id="row_14_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dcc/strong__number_8c.html" target="_self">strong_number.c</a></td><td class="desc">Strong number is a number whose sum of all digits factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120) </td></tr>
<tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9658;</span><span id="img_15_" class="iconfclosed" onclick="toggleFolder('15_')">&#160;</span><a class="el" href="dir_a52f4d3d586a58b02f3a4ddf0a992157.html" target="_self">misc</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/dcb/poly__add_8c.html" target="_self">poly_add.c</a></td><td class="desc">Implementation of [Addition of two polynomials] (<a href="https://en.wikipedia.org/wiki/Polynomial#Addition">https://en.wikipedia.org/wiki/Polynomial#Addition</a>) </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d43/postfix__evaluation_8c.html" target="_self">postfix_evaluation.c</a></td><td class="desc"><a href="https://www.includehelp.com/c/evaluation-of-postfix-expressions-using-stack-with-c-program.aspx" target="_blank">Postfix evaluation algorithm</a> implementation </td></tr>
<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/rot13_8c.html" target="_self">rot13.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ROT13" target="_blank">ROT13</a> is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the alphabet </td></tr>
<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc7/run__length__encoding_8c.html" target="_self">run_length_encoding.c</a></td><td class="desc">Encode a null terminated string using <a href="https://en.wikipedia.org/wiki/Run-length_encoding" target="_blank">Run-length encoding</a> </td></tr>
<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dac/sudoku__solver_8c.html" target="_self">sudoku_solver.c</a></td><td class="desc">Sudoku Solver using recursive implementation of brute-force algorithm </td></tr>
<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/df3/union__find_8c.html" target="_self">union_find.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Union find</a> algorithm </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">&#9658;</span><span id="img_16_" class="iconfclosed" onclick="toggleFolder('16_')">&#160;</span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d38/durand__kerner__roots_8c.html" target="_self">durand_kerner_roots.c</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> </td></tr>
<tr id="row_16_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d2e/lu__decompose_8c.html" target="_self">lu_decompose.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </td></tr>
<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d08/newton__raphson__root_8c.html" target="_self">newton_raphson_root.c</a></td><td class="desc">Find approximate solution for \(f(x) = 0\) using Newton-Raphson interpolation algorithm </td></tr>
<tr id="row_16_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d07/ode__forward__euler_8c.html" target="_self">ode_forward_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> </td></tr>
<tr id="row_16_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc2/ode__midpoint__euler_8c.html" target="_self">ode_midpoint_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> </td></tr>
<tr id="row_16_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html" target="_self">ode_semi_implicit_euler.c</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> </td></tr>
<tr id="row_16_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_16_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d23/qr__decomposition_8c.html" target="_self">qr_decomposition.c</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
<tr id="row_16_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d50/qr__eigen__values_8c.html" target="_self">qr_eigen_values.c</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method </td></tr>
<tr id="row_16_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d47/realtime__stats_8c.html" target="_self">realtime_stats.c</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_17_" class="arrow" onclick="toggleFolder('17_')">&#9658;</span><span id="img_17_" class="iconfclosed" onclick="toggleFolder('17_')">&#160;</span><a class="el" href="dir_63185e90e67935ef3eb5903a044c89e2.html" target="_self">process_scheduling_algorithms</a></td><td class="desc"></td></tr>
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html" target="_self">non_preemptive_priority_scheduling.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Scheduling_(computing)" target="_blank">Non-Preemptive Priority Scheduling</a> is a scheduling algorithm that selects the tasks to execute based on priority </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="toggleFolder('18_')">&#9658;</span><span id="img_18_" class="iconfclosed" onclick="toggleFolder('18_')">&#160;</span><a class="el" href="dir_b3d331eabd4234f247030c297aaf021c.html" target="_self">project_euler</a></td><td class="desc"></td></tr>
<tr id="row_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_0_" class="arrow" onclick="toggleFolder('18_0_')">&#9658;</span><span id="img_18_0_" class="iconfclosed" onclick="toggleFolder('18_0_')">&#160;</span><a class="el" href="dir_8c6743d405e8ed13cc39f42e382307fd.html" target="_self">problem_1</a></td><td class="desc"></td></tr>
<tr id="row_18_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d35/problem__1_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_18_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/dae/problem__1_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_18_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d56/problem__1_2sol3_8c.html" target="_self">sol3.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_18_0_3_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d1b/sol4_8c.html" target="_self">sol4.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=1" target="_blank">Problem 1</a> solution </td></tr>
<tr id="row_18_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_1_" class="arrow" onclick="toggleFolder('18_1_')">&#9658;</span><span id="img_18_1_" class="iconfclosed" onclick="toggleFolder('18_1_')">&#160;</span><a class="el" href="dir_16b947d8e9a05fe119d0675493324331.html" target="_self">problem_10</a></td><td class="desc"></td></tr>
<tr id="row_18_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6d/problem__10_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=10" target="_blank">Problem 10</a> solution </td></tr>
<tr id="row_18_1_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/da7/problem__10_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=10" target="_blank">Problem 10</a> solution </td></tr>
<tr id="row_18_2_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_2_" class="arrow" onclick="toggleFolder('18_2_')">&#9658;</span><span id="img_18_2_" class="iconfclosed" onclick="toggleFolder('18_2_')">&#160;</span><a class="el" href="dir_d9112ab06cf4d4e5a25d385a268d1949.html" target="_self">problem_12</a></td><td class="desc"></td></tr>
<tr id="row_18_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d1f/problem__12_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=12" target="_blank">Problem 12</a> solution </td></tr>
<tr id="row_18_3_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_3_" class="arrow" onclick="toggleFolder('18_3_')">&#9658;</span><span id="img_18_3_" class="iconfclosed" onclick="toggleFolder('18_3_')">&#160;</span><a class="el" href="dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html" target="_self">problem_13</a></td><td class="desc"></td></tr>
<tr id="row_18_3_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d01/problem__13_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=13" target="_blank">Problem 13</a> solution </td></tr>
<tr id="row_18_4_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_4_" class="arrow" onclick="toggleFolder('18_4_')">&#9658;</span><span id="img_18_4_" class="iconfclosed" onclick="toggleFolder('18_4_')">&#160;</span><a class="el" href="dir_aba97bf327db94061e830e9bc18e925d.html" target="_self">problem_14</a></td><td class="desc"></td></tr>
<tr id="row_18_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dea/problem__14_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=14" target="_blank">Problem 14</a> solution </td></tr>
<tr id="row_18_5_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_5_" class="arrow" onclick="toggleFolder('18_5_')">&#9658;</span><span id="img_18_5_" class="iconfclosed" onclick="toggleFolder('18_5_')">&#160;</span><a class="el" href="dir_2b14f32f14b51065d3a322bea21da3c0.html" target="_self">problem_15</a></td><td class="desc"></td></tr>
<tr id="row_18_5_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d91/problem__15_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=15" target="_blank">Problem 15</a> solution </td></tr>
<tr id="row_18_6_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_6_" class="arrow" onclick="toggleFolder('18_6_')">&#9658;</span><span id="img_18_6_" class="iconfclosed" onclick="toggleFolder('18_6_')">&#160;</span><a class="el" href="dir_18cba55772148686552805a354a79093.html" target="_self">problem_16</a></td><td class="desc"></td></tr>
<tr id="row_18_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d88/problem__16_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=16" target="_blank">Problem 16</a> solution </td></tr>
<tr id="row_18_7_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_7_" class="arrow" onclick="toggleFolder('18_7_')">&#9658;</span><span id="img_18_7_" class="iconfclosed" onclick="toggleFolder('18_7_')">&#160;</span><a class="el" href="dir_0bc3e2a5baf077fa21dadc079776fcac.html" target="_self">problem_19</a></td><td class="desc"></td></tr>
<tr id="row_18_7_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/df0/problem__19_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=19" target="_blank">Problem 19</a> solution </td></tr>
<tr id="row_18_8_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_8_" class="arrow" onclick="toggleFolder('18_8_')">&#9658;</span><span id="img_18_8_" class="iconfclosed" onclick="toggleFolder('18_8_')">&#160;</span><a class="el" href="dir_eeeea13e3a5e5edad3499183767ce312.html" target="_self">problem_2</a></td><td class="desc"></td></tr>
<tr id="row_18_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d7f/so1_8c.html" target="_self">so1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=2" target="_blank">Problem 2</a> solution </td></tr>
<tr id="row_18_9_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_9_" class="arrow" onclick="toggleFolder('18_9_')">&#9658;</span><span id="img_18_9_" class="iconfclosed" onclick="toggleFolder('18_9_')">&#160;</span><a class="el" href="dir_4991c92e00761dd3d764efa2906b4318.html" target="_self">problem_20</a></td><td class="desc"></td></tr>
<tr id="row_18_9_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/problem__20_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=20" target="_blank">Problem 20</a> solution </td></tr>
<tr id="row_18_10_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_10_" class="arrow" onclick="toggleFolder('18_10_')">&#9658;</span><span id="img_18_10_" class="iconfclosed" onclick="toggleFolder('18_10_')">&#160;</span><a class="el" href="dir_d9e100c82ada2163abea49688a71e81c.html" target="_self">problem_21</a></td><td class="desc"></td></tr>
<tr id="row_18_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d1a/problem__21_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=21" target="_blank">Problem 21</a> solution </td></tr>
<tr id="row_18_11_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_11_" class="arrow" onclick="toggleFolder('18_11_')">&#9658;</span><span id="img_18_11_" class="iconfclosed" onclick="toggleFolder('18_11_')">&#160;</span><a class="el" href="dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html" target="_self">problem_22</a></td><td class="desc"></td></tr>
<tr id="row_18_11_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d8b/problem__22_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=22" target="_blank">Problem 22</a> solution </td></tr>
<tr id="row_18_12_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_12_" class="arrow" onclick="toggleFolder('18_12_')">&#9658;</span><span id="img_18_12_" class="iconfclosed" onclick="toggleFolder('18_12_')">&#160;</span><a class="el" href="dir_f75ccd45e00436eafed446b9b2682984.html" target="_self">problem_23</a></td><td class="desc"></td></tr>
<tr id="row_18_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/ddb/problem__23_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution </td></tr>
<tr id="row_18_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/dbd/problem__23_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution - optimization using look-up array </td></tr>
<tr id="row_18_13_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_13_" class="arrow" onclick="toggleFolder('18_13_')">&#9658;</span><span id="img_18_13_" class="iconfclosed" onclick="toggleFolder('18_13_')">&#160;</span><a class="el" href="dir_079e1f799fb08a8a0b98cb030ab15687.html" target="_self">problem_25</a></td><td class="desc"></td></tr>
<tr id="row_18_13_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d32/problem__25_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=25" target="_blank">Problem 25</a> solution implemented using arbitrarily large numbers represented as arrays </td></tr>
<tr id="row_18_14_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_14_" class="arrow" onclick="toggleFolder('18_14_')">&#9658;</span><span id="img_18_14_" class="iconfclosed" onclick="toggleFolder('18_14_')">&#160;</span><a class="el" href="dir_16e00c78ef36d1842d0d8a4afc46b852.html" target="_self">problem_26</a></td><td class="desc"></td></tr>
<tr id="row_18_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/df9/problem__26_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=26" target="_blank">Problem 26</a> solution </td></tr>
<tr id="row_18_15_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_15_" class="arrow" onclick="toggleFolder('18_15_')">&#9658;</span><span id="img_18_15_" class="iconfclosed" onclick="toggleFolder('18_15_')">&#160;</span><a class="el" href="dir_b2dbfa46230fd9f775c32c1836ed3764.html" target="_self">problem_3</a></td><td class="desc"></td></tr>
<tr id="row_18_15_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/dd3/problem__3_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=3" target="_blank">Problem 3</a> solution </td></tr>
<tr id="row_18_15_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/dbc/problem__3_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=3" target="_blank">Problem 3</a> solution </td></tr>
<tr id="row_18_16_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_16_" class="arrow" onclick="toggleFolder('18_16_')">&#9658;</span><span id="img_18_16_" class="iconfclosed" onclick="toggleFolder('18_16_')">&#160;</span><a class="el" href="dir_1833eb69ceee7a265ffba4c38c8243d2.html" target="_self">problem_4</a></td><td class="desc"></td></tr>
<tr id="row_18_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6c/problem__4_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=4" target="_blank">Problem 4</a> solution </td></tr>
<tr id="row_18_17_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_17_" class="arrow" onclick="toggleFolder('18_17_')">&#9658;</span><span id="img_18_17_" class="iconfclosed" onclick="toggleFolder('18_17_')">&#160;</span><a class="el" href="dir_2f070f19f76dfadabbc24fe483d7e98d.html" target="_self">problem_401</a></td><td class="desc"></td></tr>
<tr id="row_18_17_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d83/problem__401_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=401" target="_blank">Problem 401</a> solution - Sum of squares of divisors </td></tr>
<tr id="row_18_18_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_18_" class="arrow" onclick="toggleFolder('18_18_')">&#9658;</span><span id="img_18_18_" class="iconfclosed" onclick="toggleFolder('18_18_')">&#160;</span><a class="el" href="dir_607f15d36c772334f988bb9ef82d102c.html" target="_self">problem_5</a></td><td class="desc"></td></tr>
<tr id="row_18_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d32/problem__5_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution - Naive algorithm (slowest) </td></tr>
<tr id="row_18_18_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d3d/problem__5_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution - Naive algorithm (Improved over <a class="el" href="dc/d32/problem__5_2sol1_8c.html" title="Problem 5 solution - Naive algorithm (slowest)">problem_5/sol1.c</a>) </td></tr>
<tr id="row_18_18_2_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d7c/problem__5_2sol3_8c.html" target="_self">sol3.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=5" target="_blank">Problem 5</a> solution (Fastest) </td></tr>
<tr id="row_18_19_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_19_" class="arrow" onclick="toggleFolder('18_19_')">&#9658;</span><span id="img_18_19_" class="iconfclosed" onclick="toggleFolder('18_19_')">&#160;</span><a class="el" href="dir_167af11096b7752ff31b3d4bec489317.html" target="_self">problem_6</a></td><td class="desc"></td></tr>
<tr id="row_18_19_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d7b/problem__6_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=6" target="_blank">Problem 6</a> solution </td></tr>
<tr id="row_18_20_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_20_" class="arrow" onclick="toggleFolder('18_20_')">&#9658;</span><span id="img_18_20_" class="iconfclosed" onclick="toggleFolder('18_20_')">&#160;</span><a class="el" href="dir_4bae997a2671812c2140d5abfb6305a4.html" target="_self">problem_7</a></td><td class="desc"></td></tr>
<tr id="row_18_20_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d2f/problem__7_2sol_8c.html" target="_self">sol.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=7" target="_blank">Problem 7</a> solution </td></tr>
<tr id="row_18_20_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d64/problem__7_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=7" target="_blank">Problem 7</a> solution </td></tr>
<tr id="row_18_21_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_21_" class="arrow" onclick="toggleFolder('18_21_')">&#9658;</span><span id="img_18_21_" class="iconfclosed" onclick="toggleFolder('18_21_')">&#160;</span><a class="el" href="dir_4a15c8553efb9e59e3f1091cc0d3a27d.html" target="_self">problem_8</a></td><td class="desc"></td></tr>
<tr id="row_18_21_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d63/problem__8_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=8" target="_blank">Problem 8</a> solution </td></tr>
<tr id="row_18_21_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d93/problem__8_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=8" target="_blank">Problem 8</a> solution </td></tr>
<tr id="row_18_22_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_18_22_" class="arrow" onclick="toggleFolder('18_22_')">&#9658;</span><span id="img_18_22_" class="iconfclosed" onclick="toggleFolder('18_22_')">&#160;</span><a class="el" href="dir_d4c35186c199e728d69dee6bf5b2473c.html" target="_self">problem_9</a></td><td class="desc"></td></tr>
<tr id="row_18_22_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/da5/problem__9_2sol1_8c.html" target="_self">sol1.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9" target="_blank">Problem 9</a> solution - A naive implementation </td></tr>
<tr id="row_18_22_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/de0/problem__9_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9" target="_blank">Problem 9</a> solution </td></tr>
<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="toggleFolder('19_')">&#9658;</span><span id="img_19_" class="iconfclosed" onclick="toggleFolder('19_')">&#160;</span><a class="el" href="dir_da574daf9ce9c05b45556bdc871ed1e3.html" target="_self">searching</a></td><td class="desc"></td></tr>
<tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d3b/binary__search_8c.html" target="_self">binary_search.c</a></td><td class="desc">Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm" target="_blank">binary search</a> of a target value in a given <em>sorted</em> array </td></tr>
<tr id="row_19_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d6c/exponential__search_8c.html" target="_self">exponential_search.c</a></td><td class="desc"><a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Exponential%20Search.md" target="_blank">Exponential Search</a> </td></tr>
<tr id="row_19_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html" target="_self">floyd_cycle_detection_algorithm.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
<tr id="row_19_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d7b/jump__search_8c.html" target="_self">jump_search.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">jump search</a> algorithm </td></tr>
<tr id="row_19_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d47/modified__binary__search_8c.html" target="_self">modified_binary_search.c</a></td><td class="desc"><a href="https://arxiv.org/abs/1406.1677" target="_blank">Modified binary search algorithm</a> </td></tr>
<tr id="row_19_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/de2/sentinel__linear__search_8c.html" target="_self">sentinel_linear_search.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search#With_a_sentinel" target="_blank">Linear Search with Sentinel</a> algorithm implementation </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_20_" class="arrow" onclick="toggleFolder('20_')">&#9658;</span><span id="img_20_" class="iconfclosed" onclick="toggleFolder('20_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
<tr id="row_20_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/da8/bead__sort_8c.html" target="_self">bead_sort.c</a></td><td class="desc">Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort" target="_blank">bead sort</a> </td></tr>
<tr id="row_20_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/de4/bubble__sort_8c.html" target="_self">bubble_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm implementation </td></tr>
<tr id="row_20_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d6d/bubble__sort__2_8c.html" target="_self">bubble_sort_2.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm </td></tr>
<tr id="row_20_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d38/bubble__sort__recursion_8c.html" target="_self">bubble_sort_recursion.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bubble_sort" target="_blank">Bubble sort</a> algorithm implementation using recursion </td></tr>
<tr id="row_20_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dff/heap__sort__2_8c.html" target="_self">heap_sort_2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort</a> implementation </td></tr>
<tr id="row_20_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/ddf/insertion__sort_8c.html" target="_self">insertion_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_20_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d0c/insertion__sort__recursive_8c.html" target="_self">insertion_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_20_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d83/merge__sort_8c.html" target="_self">merge_sort.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">merge sort</a> algorithm </td></tr>
<tr id="row_20_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d94/odd__even__sort_8c.html" target="_self">odd_even_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort" target="_blank">Odd Even Sort</a> implementation </td></tr>
<tr id="row_20_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d83/selection__sort_8c.html" target="_self">selection_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> algorithm implementation </td></tr>
<tr id="row_20_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d39/selection__sort__recursive_8c.html" target="_self">selection_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection Sort</a> implementation using recursion </td></tr>
<tr id="row_20_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort algorithm</a> implementation </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

View File

@ -5,6 +5,7 @@ var files_dup =
[ "conversions", "dir_9babc524d57e25f3d9f4179cabc3599e.html", "dir_9babc524d57e25f3d9f4179cabc3599e" ],
[ "data_structures", "dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html", "dir_2e746e9d06bf2d8ff842208bcc6ebcfc" ],
[ "developer_tools", "dir_abf1a26ece768c4076e73592705ae077.html", "dir_abf1a26ece768c4076e73592705ae077" ],
[ "dynamic_programming", "dir_8a20dd5bfd5341a725342bf72b6b686f.html", "dir_8a20dd5bfd5341a725342bf72b6b686f" ],
[ "exercism", "dir_48bf5503321d91c557399989fed5dabd.html", "dir_48bf5503321d91c557399989fed5dabd" ],
[ "games", "dir_4b6f782e158b0b98da980a0e11a23a15.html", "dir_4b6f782e158b0b98da980a0e11a23a15" ],
[ "geometry", "dir_e3380d2178455503f266746fb14246a5.html", "dir_e3380d2178455503f266746fb14246a5" ],

View File

@ -119,8 +119,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>isEmpty()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">infix_to_postfix2.c</a></li>
<li>isOprnd()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b">infix_to_postfix.c</a></li>
<li>isPalindrome()&#160;:&#160;<a class="el" href="df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">palindrome.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isStrong()&#160;:&#160;<a class="el" href="d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">strong_number.c</a></li>
</ul>
</div><!-- contents -->

View File

@ -103,6 +103,8 @@ $(document).ready(function(){initNavTree('globals_func_l.html',''); initResizabl
<li>l_length()&#160;:&#160;<a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#a40e454ce0750e794007bf41a7102b3a9">non_preemptive_priority_scheduling.c</a></li>
<li>lazy_sort()&#160;:&#160;<a class="el" href="dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d">sol1.c</a></li>
<li>lcm()&#160;:&#160;<a class="el" href="d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">sol3.c</a></li>
<li>lcsbuild()&#160;:&#160;<a class="el" href="db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0">lcs.c</a></li>
<li>lcslen()&#160;:&#160;<a class="el" href="db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6">lcs.c</a></li>
<li>len()&#160;:&#160;<a class="el" href="df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93">vector.c</a></li>
<li>lu_decomposition()&#160;:&#160;<a class="el" href="dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4">lu_decompose.c</a></li>
</ul>

File diff suppressed because one or more lines are too long

View File

@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
&#160;
<h3><a id="index_t" name="index_t"></a>- t -</h3><ul>
<li>test()&#160;:&#160;<a class="el" href="df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5">alaw.c</a>, <a class="el" href="d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d">celsius_to_fahrenheit.c</a>, <a class="el" href="d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_any_base.c</a>, <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_binary_recursion.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d">infix_to_postfix2.c</a>, <a class="el" href="dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d">int_to_string.c</a>, <a class="el" href="d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">octal_to_hexadecimal.c</a>, <a class="el" href="dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">roman_numerals_to_decimal.c</a>, <a class="el" href="da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">segment_tree.c</a>, <a class="el" href="d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d">words_alphabetical.c</a>, <a class="el" href="df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d">vector.c</a>, <a class="el" href="d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d">vectors_3d.c</a>, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>, <a class="el" href="d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c">prim.c</a>, <a class="el" href="d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d">6.c</a>, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>, <a class="el" href="d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci_formula.c</a>, <a class="el" href="da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002">prime.c</a>, <a class="el" href="d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d">prime_sieve.c</a>, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>, <a class="el" href="df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d">postfix_evaluation.c</a>, <a class="el" href="de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d">rot13.c</a>, <a class="el" href="d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d">run_length_encoding.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d">non_preemptive_priority_scheduling.c</a>, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>, <a class="el" href="da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">exponential_search.c</a>, <a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d">floyd_cycle_detection_algorithm.c</a>, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>, <a class="el" href="d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">sentinel_linear_search.c</a>, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>, <a class="el" href="d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">bubble_sort_2.c</a>, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>, <a class="el" href="de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">heap_sort_2.c</a>, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>, <a class="el" href="de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort_recursive.c</a>, <a class="el" href="d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">odd_even_sort.c</a>, <a class="el" href="df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort.c</a>, <a class="el" href="dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort_recursive.c</a></li>
<li>test()&#160;:&#160;<a class="el" href="df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5">alaw.c</a>, <a class="el" href="d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d">celsius_to_fahrenheit.c</a>, <a class="el" href="d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_any_base.c</a>, <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_binary_recursion.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d">infix_to_postfix2.c</a>, <a class="el" href="dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d">int_to_string.c</a>, <a class="el" href="d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">octal_to_hexadecimal.c</a>, <a class="el" href="dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">roman_numerals_to_decimal.c</a>, <a class="el" href="da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">segment_tree.c</a>, <a class="el" href="d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d">words_alphabetical.c</a>, <a class="el" href="df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d">vector.c</a>, <a class="el" href="db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d">lcs.c</a>, <a class="el" href="d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d">vectors_3d.c</a>, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>, <a class="el" href="d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c">prim.c</a>, <a class="el" href="d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d">6.c</a>, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>, <a class="el" href="d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci_formula.c</a>, <a class="el" href="da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002">prime.c</a>, <a class="el" href="d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d">prime_sieve.c</a>, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>, <a class="el" href="df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d">postfix_evaluation.c</a>, <a class="el" href="de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d">rot13.c</a>, <a class="el" href="d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d">run_length_encoding.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d">non_preemptive_priority_scheduling.c</a>, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>, <a class="el" href="da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">exponential_search.c</a>, <a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d">floyd_cycle_detection_algorithm.c</a>, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>, <a class="el" href="d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">sentinel_linear_search.c</a>, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>, <a class="el" href="d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">bubble_sort_2.c</a>, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>, <a class="el" href="de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">heap_sort_2.c</a>, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>, <a class="el" href="de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort_recursive.c</a>, <a class="el" href="d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">odd_even_sort.c</a>, <a class="el" href="df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort.c</a>, <a class="el" href="dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort_recursive.c</a></li>
<li>test1()&#160;:&#160;<a class="el" href="dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">adaline_learning.c</a>, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_trace.c</a>, <a class="el" href="d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af">poly_add.c</a>, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">qr_eigen_values.c</a></li>
<li>test2()&#160;:&#160;<a class="el" href="dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">adaline_learning.c</a>, <a class="el" href="d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0">k_means_clustering.c</a>, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.c</a>, <a class="el" href="d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409">poly_add.c</a>, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">qr_eigen_values.c</a></li>
<li>test3()&#160;:&#160;<a class="el" href="dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">adaline_learning.c</a>, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.c</a>, <a class="el" href="d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57">poly_add.c</a></li>

View File

@ -120,8 +120,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>isEmpty()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">infix_to_postfix2.c</a></li>
<li>isOprnd()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b">infix_to_postfix.c</a></li>
<li>isPalindrome()&#160;:&#160;<a class="el" href="df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">palindrome.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isStrong()&#160;:&#160;<a class="el" href="d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">strong_number.c</a></li>
</ul>
</div><!-- contents -->

View File

@ -104,6 +104,8 @@ $(document).ready(function(){initNavTree('globals_l.html',''); initResizable();
<li>large_num&#160;:&#160;<a class="el" href="d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d">factorial_large_number.c</a></li>
<li>lazy_sort()&#160;:&#160;<a class="el" href="dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d">sol1.c</a></li>
<li>lcm()&#160;:&#160;<a class="el" href="d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">sol3.c</a></li>
<li>lcsbuild()&#160;:&#160;<a class="el" href="db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0">lcs.c</a></li>
<li>lcslen()&#160;:&#160;<a class="el" href="db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6">lcs.c</a></li>
<li>LEN&#160;:&#160;<a class="el" href="df/d27/alaw_8c.html#a05b49c662c073f89e86804f7856622a0">alaw.c</a></li>
<li>len()&#160;:&#160;<a class="el" href="df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93">vector.c</a></li>
<li>LIMS&#160;:&#160;<a class="el" href="d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">qr_eigen_values.c</a></li>

File diff suppressed because one or more lines are too long

View File

@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
<div class="textblock">Here is a list of all documented functions, variables, defines, enums, and typedefs with links to the documentation:</div>
<h3><a id="index_t" name="index_t"></a>- t -</h3><ul>
<li>test()&#160;:&#160;<a class="el" href="df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5">alaw.c</a>, <a class="el" href="d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d">celsius_to_fahrenheit.c</a>, <a class="el" href="d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_any_base.c</a>, <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_binary_recursion.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d">infix_to_postfix2.c</a>, <a class="el" href="dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d">int_to_string.c</a>, <a class="el" href="d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">octal_to_hexadecimal.c</a>, <a class="el" href="dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">roman_numerals_to_decimal.c</a>, <a class="el" href="da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">segment_tree.c</a>, <a class="el" href="d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d">words_alphabetical.c</a>, <a class="el" href="df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d">vector.c</a>, <a class="el" href="d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d">vectors_3d.c</a>, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>, <a class="el" href="d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c">prim.c</a>, <a class="el" href="d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d">6.c</a>, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>, <a class="el" href="d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci_formula.c</a>, <a class="el" href="da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002">prime.c</a>, <a class="el" href="d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d">prime_sieve.c</a>, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>, <a class="el" href="df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d">postfix_evaluation.c</a>, <a class="el" href="de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d">rot13.c</a>, <a class="el" href="d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d">run_length_encoding.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d">non_preemptive_priority_scheduling.c</a>, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>, <a class="el" href="da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">exponential_search.c</a>, <a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d">floyd_cycle_detection_algorithm.c</a>, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>, <a class="el" href="d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">sentinel_linear_search.c</a>, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>, <a class="el" href="d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">bubble_sort_2.c</a>, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>, <a class="el" href="de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">heap_sort_2.c</a>, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>, <a class="el" href="de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort_recursive.c</a>, <a class="el" href="d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">odd_even_sort.c</a>, <a class="el" href="df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort.c</a>, <a class="el" href="dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort_recursive.c</a></li>
<li>test()&#160;:&#160;<a class="el" href="df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5">alaw.c</a>, <a class="el" href="d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d">celsius_to_fahrenheit.c</a>, <a class="el" href="d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_any_base.c</a>, <a class="el" href="d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d">decimal_to_binary_recursion.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d">infix_to_postfix2.c</a>, <a class="el" href="dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d">int_to_string.c</a>, <a class="el" href="d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">octal_to_hexadecimal.c</a>, <a class="el" href="dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d">roman_numerals_to_decimal.c</a>, <a class="el" href="da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d">segment_tree.c</a>, <a class="el" href="d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d">words_alphabetical.c</a>, <a class="el" href="df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d">vector.c</a>, <a class="el" href="db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d">lcs.c</a>, <a class="el" href="d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d">vectors_3d.c</a>, <a class="el" href="d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">spirograph.c</a>, <a class="el" href="d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c">prim.c</a>, <a class="el" href="d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d">6.c</a>, <a class="el" href="d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d">k_means_clustering.c</a>, <a class="el" href="d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">cartesian_to_polar.c</a>, <a class="el" href="d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci_formula.c</a>, <a class="el" href="da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002">prime.c</a>, <a class="el" href="d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d">prime_sieve.c</a>, <a class="el" href="d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002">strong_number.c</a>, <a class="el" href="df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d">postfix_evaluation.c</a>, <a class="el" href="de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d">rot13.c</a>, <a class="el" href="d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d">run_length_encoding.c</a>, <a class="el" href="d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d">non_preemptive_priority_scheduling.c</a>, <a class="el" href="df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">binary_search.c</a>, <a class="el" href="da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">exponential_search.c</a>, <a class="el" href="d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d">floyd_cycle_detection_algorithm.c</a>, <a class="el" href="d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">jump_search.c</a>, <a class="el" href="d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d">sentinel_linear_search.c</a>, <a class="el" href="dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort.c</a>, <a class="el" href="d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">bubble_sort_2.c</a>, <a class="el" href="d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002">bubble_sort_recursion.c</a>, <a class="el" href="de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d">heap_sort_2.c</a>, <a class="el" href="db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort.c</a>, <a class="el" href="de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">insertion_sort_recursive.c</a>, <a class="el" href="d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">odd_even_sort.c</a>, <a class="el" href="df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort.c</a>, <a class="el" href="dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d">selection_sort_recursive.c</a></li>
<li>test1()&#160;:&#160;<a class="el" href="dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">adaline_learning.c</a>, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_trace.c</a>, <a class="el" href="d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af">poly_add.c</a>, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">qr_eigen_values.c</a></li>
<li>test2()&#160;:&#160;<a class="el" href="dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">adaline_learning.c</a>, <a class="el" href="d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0">k_means_clustering.c</a>, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.c</a>, <a class="el" href="d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409">poly_add.c</a>, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">qr_eigen_values.c</a></li>
<li>test3()&#160;:&#160;<a class="el" href="dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">adaline_learning.c</a>, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.c</a>, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.c</a>, <a class="el" href="d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57">poly_add.c</a></li>

View File

@ -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_md76"></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_md77"></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_md78"></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_md79"></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 -->

View File

@ -26,10 +26,10 @@ var NAVTREE =
[
[ "Algorithms_in_C", "index.html", [
[ "The Algorithms - C", "index.html", [
[ "Overview", "index.html#autotoc_md76", null ],
[ "Features", "index.html#autotoc_md77", null ],
[ "Documentation", "index.html#autotoc_md78", null ],
[ "Contributions", "index.html#autotoc_md79", 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 ]
] ],
[ "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 ],
@ -86,30 +86,32 @@ var NAVTREE =
[ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ],
[ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ],
[ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ],
[ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
[ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
[ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
[ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
[ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
[ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
[ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
[ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ],
[ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ],
[ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ],
[ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ],
[ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ],
[ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ],
[ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ]
[ "Dynamic Programming", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ],
[ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ],
[ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ],
[ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ],
[ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ],
[ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ],
[ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ],
[ "Leetcode", "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 ]
] ],
[ "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_md71", null ],
[ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72", [
[ "📜 Adding your new solution to the list 📜", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ]
[ "💻 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", [
[ "📜 Adding your new solution to the list 📜", "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_md74", 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 ],
@ -139,9 +141,9 @@ var NAVTREEINDEX =
[
"annotated.html",
"d4/d68/qr__decompose_8h_source.html",
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235",
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853",
"globals_func_a.html"
"d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97",
"dc/de3/hash__set_8h_source.html",
"globals_b.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

View File

@ -4,31 +4,31 @@ var NAVTREEINDEX0 =
"classes.html":[15,1],
"d0/d10/struct_queue_rep.html":[15,0,33],
"d0/d43/structpid.html":[15,0,30],
"d0/d46/kohonen__som__trace_8c.html":[16,0,12,3],
"d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,12,3,11],
"d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8":[16,0,12,3,14],
"d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0":[16,0,12,3,10],
"d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908":[16,0,12,3,4],
"d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,12,3,8],
"d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0":[16,0,12,3,13],
"d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e":[16,0,12,3,0],
"d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e":[16,0,12,3,12],
"d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614":[16,0,12,3,15],
"d0/d46/kohonen__som__trace_8c.html":[16,0,13,3],
"d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,13,3,11],
"d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8":[16,0,13,3,14],
"d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0":[16,0,13,3,10],
"d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908":[16,0,13,3,4],
"d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,13,3,8],
"d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0":[16,0,13,3,13],
"d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e":[16,0,13,3,0],
"d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e":[16,0,13,3,12],
"d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614":[16,0,13,3,15],
"d0/d51/celsius__to__fahrenheit_8c.html":[16,0,2,1],
"d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,2,1,2],
"d0/d51/celsius__to__fahrenheit_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,1,1],
"d0/d51/celsius__to__fahrenheit_8c.html#aff11c1dfc058bd545a6af4312dfb45c5":[16,0,2,1,0],
"d0/d57/hash__xor8_8c.html":[14,1,4],
"d0/d6b/structelem.html":[15,0,14],
"d0/d6c/problem__4_2sol_8c.html":[16,0,17,16,0],
"d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,16,0,1],
"d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4":[16,0,17,16,0,0],
"d0/d6d/problem__10_2sol1_8c.html":[16,0,17,1,0],
"d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,17,1,0,1],
"d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f":[16,0,17,1,0,0],
"d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5":[16,0,17,1,0,2],
"d0/d7f/so1_8c.html":[16,0,17,8,0],
"d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,8,0,0],
"d0/d6c/problem__4_2sol_8c.html":[16,0,18,16,0],
"d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,16,0,1],
"d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4":[16,0,18,16,0,0],
"d0/d6d/problem__10_2sol1_8c.html":[16,0,18,1,0],
"d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,1,0,1],
"d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f":[16,0,18,1,0,0],
"d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5":[16,0,18,1,0,2],
"d0/d7f/so1_8c.html":[16,0,18,8,0],
"d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,8,0,0],
"d0/d8a/octal__to__hexadecimal_8c.html":[16,0,2,8],
"d0/d8a/octal__to__hexadecimal_8c.html#a823ef5170955cfef40e07d9a4d2e87e2":[16,0,2,8,2],
"d0/d8a/octal__to__hexadecimal_8c.html#a86a4edb605c2a03d9175c59de679347d":[16,0,2,8,1],
@ -44,24 +44,24 @@ var NAVTREEINDEX0 =
"d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde":[14,2,3,4],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[14,2,3,2],
"d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f":[14,2,3,0],
"d0/dcb/poly__add_8c.html":[16,0,14,0],
"d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409":[16,0,14,0,7],
"d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d":[16,0,14,0,1],
"d0/dcb/poly__add_8c.html#a5a103fff33166d6e4d975b8b63c6e895":[16,0,14,0,3],
"d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af":[16,0,14,0,5],
"d0/dcb/poly__add_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,14,0,4],
"d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57":[16,0,14,0,8],
"d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af":[16,0,14,0,6],
"d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d":[16,0,14,0,2],
"d0/dcb/poly__add_8c.html":[16,0,15,0],
"d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409":[16,0,15,0,7],
"d0/dcb/poly__add_8c.html#a29eace09ec1373a92003075f1c2f6d9d":[16,0,15,0,1],
"d0/dcb/poly__add_8c.html#a5a103fff33166d6e4d975b8b63c6e895":[16,0,15,0,3],
"d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af":[16,0,15,0,5],
"d0/dcb/poly__add_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,15,0,4],
"d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57":[16,0,15,0,8],
"d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af":[16,0,15,0,6],
"d0/dcb/poly__add_8c.html#ab9b9bedcb99f279d491d1b856791a36d":[16,0,15,0,2],
"d0/dd9/hexadecimal__to__octal2_8c.html":[16,0,2,4],
"d0/dd9/hexadecimal__to__octal2_8c.html#ab83549c0d43c88544be47fa6c4885ae4":[16,0,2,4,0],
"d0/dd9/hexadecimal__to__octal2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,4,1],
"d0/df1/structhash__set__t.html":[15,0,18],
"d0/df3/6_8c.html":[16,0,11,0,0],
"d0/df3/6_8c.html#a109c3813445bcf97d154a671119deae9":[16,0,11,0,0,3],
"d0/df3/6_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,11,0,0,1],
"d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,11,0,0,2],
"d0/df3/6_8c.html#afdf3bfe2dc8aadac13c7e6d051d3bd5d":[16,0,11,0,0,0],
"d0/df3/6_8c.html":[16,0,12,0,0],
"d0/df3/6_8c.html#a109c3813445bcf97d154a671119deae9":[16,0,12,0,0,3],
"d0/df3/6_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,12,0,0,1],
"d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,12,0,0,2],
"d0/df3/6_8c.html#afdf3bfe2dc8aadac13c7e6d051d3bd5d":[16,0,12,0,0,0],
"d1/d12/md_data_structures_stack__r_e_a_d_m_e.html":[6],
"d1/d20/server_8c.html":[16,0,1,3],
"d1/d20/server_8c.html#a1e43924adac4ae865aa0acf79710261c":[16,0,1,3,2],
@ -69,8 +69,8 @@ var NAVTREEINDEX0 =
"d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,3,1],
"d1/d20/server_8c.html#ac17020a38607ab29ce18939d5194a32a":[16,0,1,3,3],
"d1/d20/server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,3,4],
"d1/d2f/problem__7_2sol_8c.html":[16,0,17,20,0],
"d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,20,0,0],
"d1/d2f/problem__7_2sol_8c.html":[16,0,18,20,0],
"d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,20,0,0],
"d1/d5e/structobservation.html":[14,2,1,0],
"d1/d5e/structobservation.html#a04f3dcfd59dd91353395e35c9831fade":[14,2,1,0,1],
"d1/d5e/structobservation.html#a2db8ace685c08aa7b52f5a28b0843aab":[14,2,1,0,0],
@ -90,11 +90,11 @@ var NAVTREEINDEX0 =
"d1/d6b/tcp__full__duplex__server_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce":[16,0,1,5,1],
"d1/d6b/tcp__full__duplex__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,5,2],
"d1/d7d/struct_list_item.html":[15,0,22],
"d1/d94/odd__even__sort_8c.html":[16,0,19,8],
"d1/d94/odd__even__sort_8c.html#a17761a0788916faded6e2ca1f478ad33":[16,0,19,8,1],
"d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,8,3],
"d1/d94/odd__even__sort_8c.html#ac2eee54959bc040cfcb56d2d8047853a":[16,0,19,8,2],
"d1/d94/odd__even__sort_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,8,0],
"d1/d94/odd__even__sort_8c.html":[16,0,20,8],
"d1/d94/odd__even__sort_8c.html#a17761a0788916faded6e2ca1f478ad33":[16,0,20,8,1],
"d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,8,3],
"d1/d94/odd__even__sort_8c.html#ac2eee54959bc040cfcb56d2d8047853a":[16,0,20,8,2],
"d1/d94/odd__even__sort_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,8,0],
"d1/d98/tcp__full__duplex__client_8c.html":[16,0,1,4],
"d1/d98/tcp__full__duplex__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,4,0],
"d1/d98/tcp__full__duplex__client_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce":[16,0,1,4,1],
@ -112,65 +112,65 @@ var NAVTREEINDEX0 =
"d1/dba/decimal__to__any__base_8c.html#ae071f62d704823751bf9a085bf0a1bd7":[16,0,2,2,3],
"d1/dba/decimal__to__any__base_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,2,4],
"d1/dbe/include_8h_source.html":[16,0,3,8,0],
"d1/dc2/ode__midpoint__euler_8c.html":[16,0,15,4],
"d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,15,4,2],
"d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd":[16,0,15,4,3],
"d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,15,4,1],
"d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4":[16,0,15,4,5],
"d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,15,4,0],
"d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51":[16,0,15,4,4],
"d1/dc7/run__length__encoding_8c.html":[16,0,14,3],
"d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,14,3,2],
"d1/dc7/run__length__encoding_8c.html#ac3cc4a63cf2a14a08e05c5537ecf59c2":[16,0,14,3,1],
"d1/dc7/run__length__encoding_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,3,0],
"d1/dc2/ode__midpoint__euler_8c.html":[16,0,16,4],
"d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,4,2],
"d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd":[16,0,16,4,3],
"d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,16,4,1],
"d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4":[16,0,16,4,5],
"d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,16,4,0],
"d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51":[16,0,16,4,4],
"d1/dc7/run__length__encoding_8c.html":[16,0,15,3],
"d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,15,3,2],
"d1/dc7/run__length__encoding_8c.html#ac3cc4a63cf2a14a08e05c5537ecf59c2":[16,0,15,3,1],
"d1/dc7/run__length__encoding_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,3,0],
"d1/ded/group__misc.html":[14,3],
"d1/ded/group__misc.html#ga6f8e8c9d25b5891d57e588d80d75028a":[14,3,0],
"d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d":[14,3,3],
"d1/ded/group__misc.html#gac0f2228420376f4db7e1274f2b41667c":[14,3,1],
"d1/ded/group__misc.html#gac1a7a8e00eeb590511465c28fae16e54":[14,3,2],
"d1/df9/problem__26_2sol1_8c.html":[16,0,17,14,0],
"d1/df9/problem__26_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,17,14,0,3],
"d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12":[16,0,17,14,0,0],
"d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe":[16,0,17,14,0,1],
"d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83":[16,0,17,14,0,2],
"d1/df9/problem__26_2sol1_8c.html":[16,0,18,14,0],
"d1/df9/problem__26_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,14,0,3],
"d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12":[16,0,18,14,0,0],
"d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe":[16,0,18,14,0,1],
"d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83":[16,0,18,14,0,2],
"d2/d36/structqueue.html":[15,0,32],
"d2/d6a/struct_graph_rep.html":[15,0,17],
"d2/d6d/bubble__sort__2_8c.html":[16,0,19,2],
"d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,19,2,0],
"d2/d6d/bubble__sort__2_8c.html#a7406723363363b34f29d18f5a80f1281":[16,0,19,2,1],
"d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,2,3],
"d2/d6d/bubble__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,2,2],
"d2/d6d/bubble__sort__2_8c.html":[16,0,20,2],
"d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,20,2,0],
"d2/d6d/bubble__sort__2_8c.html#a7406723363363b34f29d18f5a80f1281":[16,0,20,2,1],
"d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,2,3],
"d2/d6d/bubble__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,2,2],
"d2/d71/struct_a_v_lnode.html":[15,0,4],
"d2/d83/merge__sort_8c.html":[16,0,19,7],
"d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,19,7,0],
"d2/d87/non__preemptive__priority__scheduling_8c.html":[16,0,16,0],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a01b8ee561d8532a44d665c2c854e0d09":[16,0,16,0,5],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a40e454ce0750e794007bf41a7102b3a9":[16,0,16,0,7],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a458803d3c3926a6bcc4d51540f297756":[16,0,16,0,3],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36":[16,0,16,0,6],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a9bc34d3b138bd0153a942cf6a8b31533":[16,0,16,0,11],
"d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,16,0,10],
"d2/d87/non__preemptive__priority__scheduling_8c.html#abbb2446313782dd3ba9ff2a7ad0ce1df":[16,0,16,0,2],
"d2/d87/non__preemptive__priority__scheduling_8c.html#adeb04e9743495f14aa4ef78631b9253c":[16,0,16,0,9],
"d2/d87/non__preemptive__priority__scheduling_8c.html#ae5e4de64ef6c5676d5013d90229a875c":[16,0,16,0,4],
"d2/d87/non__preemptive__priority__scheduling_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,16,0,8],
"d2/d87/non__preemptive__priority__scheduling_8c.html#af4aeda155dbe167f1c1cf38cb65bf324":[16,0,16,0,1],
"d2/d93/problem__8_2sol2_8c.html":[16,0,17,21,1],
"d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,17,21,1,0],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html":[16,0,18,2],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,2,2],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html#ac7af29ae53c6659f2881fb080b080f9d":[16,0,18,2,0],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,2,1],
"d2/da8/bead__sort_8c.html":[16,0,19,0],
"d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,19,0,3],
"d2/d83/merge__sort_8c.html":[16,0,20,7],
"d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,20,7,0],
"d2/d87/non__preemptive__priority__scheduling_8c.html":[16,0,17,0],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a01b8ee561d8532a44d665c2c854e0d09":[16,0,17,0,5],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a40e454ce0750e794007bf41a7102b3a9":[16,0,17,0,7],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a458803d3c3926a6bcc4d51540f297756":[16,0,17,0,3],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a5d0943b2e0e1b48b9c3a575a7f262c36":[16,0,17,0,6],
"d2/d87/non__preemptive__priority__scheduling_8c.html#a9bc34d3b138bd0153a942cf6a8b31533":[16,0,17,0,11],
"d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,17,0,10],
"d2/d87/non__preemptive__priority__scheduling_8c.html#abbb2446313782dd3ba9ff2a7ad0ce1df":[16,0,17,0,2],
"d2/d87/non__preemptive__priority__scheduling_8c.html#adeb04e9743495f14aa4ef78631b9253c":[16,0,17,0,9],
"d2/d87/non__preemptive__priority__scheduling_8c.html#ae5e4de64ef6c5676d5013d90229a875c":[16,0,17,0,4],
"d2/d87/non__preemptive__priority__scheduling_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,0,8],
"d2/d87/non__preemptive__priority__scheduling_8c.html#af4aeda155dbe167f1c1cf38cb65bf324":[16,0,17,0,1],
"d2/d93/problem__8_2sol2_8c.html":[16,0,18,21,1],
"d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,21,1,0],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html":[16,0,19,2],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,2,2],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html#ac7af29ae53c6659f2881fb080b080f9d":[16,0,19,2,0],
"d2/d9b/floyd__cycle__detection__algorithm_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,2,1],
"d2/da8/bead__sort_8c.html":[16,0,20,0],
"d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,20,0,3],
"d2/daa/structadaline.html":[14,2,0,0],
"d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657":[14,2,0,0,2],
"d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1":[14,2,0,0,1],
"d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2":[14,2,0,0,0],
"d2/dae/problem__1_2sol2_8c.html":[16,0,17,0,1],
"d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,0,1,0],
"d2/dbc/problem__3_2sol2_8c.html":[16,0,17,15,1],
"d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,15,1,0],
"d2/dae/problem__1_2sol2_8c.html":[16,0,18,0,1],
"d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,0,1,0],
"d2/dbc/problem__3_2sol2_8c.html":[16,0,18,15,1],
"d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,15,1,0],
"d2/dc3/carray_8h_source.html":[16,0,3,0,0],
"d2/ddd/malloc__dbg_8h.html":[16,0,4,1],
"d2/ddd/malloc__dbg_8h.html#a37914d05ba1fe8848aa1b48cda719422":[16,0,4,1,5],
@ -188,21 +188,21 @@ var NAVTREEINDEX0 =
"d2/de8/structeuler__.html#aa71f9aa6dfa32d8014b2d54ab8410e0b":[14,0,2,1,3],
"d2/de8/structeuler__.html#aad52507cc423ec49847471f6f15dd9d7":[14,0,2,1,5],
"d2/de8/structeuler__.html#abbbf12f0a960faf783d219f9012cdce6":[14,0,2,1,1],
"d2/df6/kohonen__som__topology_8c.html":[16,0,12,2],
"d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,12,2,13],
"d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0":[16,0,12,2,12],
"d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908":[16,0,12,2,4],
"d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,12,2,9],
"d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e":[16,0,12,2,0],
"d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a":[16,0,12,2,17],
"d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e":[16,0,12,2,14],
"d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc":[16,0,12,2,16],
"d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018":[16,0,12,2,15],
"d2/df6/kohonen__som__topology_8c.html":[16,0,13,2],
"d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,13,2,13],
"d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0":[16,0,13,2,12],
"d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908":[16,0,13,2,4],
"d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,13,2,9],
"d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e":[16,0,13,2,0],
"d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a":[16,0,13,2,17],
"d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e":[16,0,13,2,14],
"d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc":[16,0,13,2,16],
"d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018":[16,0,13,2,15],
"d3/d39/hash__adler32_8c.html":[14,1,0],
"d3/d47/modified__binary__search_8c.html":[16,0,18,4],
"d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890":[16,0,18,4,0],
"d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f":[16,0,18,4,2],
"d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,4,1],
"d3/d47/modified__binary__search_8c.html":[16,0,19,4],
"d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890":[16,0,19,4,0],
"d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f":[16,0,19,4,2],
"d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,4,1],
"d3/d5a/struct__large__num.html":[15,0,2],
"d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0":[15,0,2,1],
"d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9":[15,0,2,0],
@ -222,13 +222,13 @@ var NAVTREEINDEX0 =
"d4/d06/struct_vector.html#a55870593ddea19c96770c2521b075059":[15,0,45,2],
"d4/d06/struct_vector.html#a8cb577f14bea1a6c1fbf85717b3ee4f9":[15,0,45,1],
"d4/d06/struct_vector.html#afd870750f3874ee097833fc8a1dc809e":[15,0,45,0],
"d4/d07/ode__forward__euler_8c.html":[16,0,15,3],
"d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,15,3,4],
"d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,15,3,1],
"d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4":[16,0,15,3,5],
"d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,15,3,0],
"d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9":[16,0,15,3,2],
"d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350":[16,0,15,3,3],
"d4/d07/ode__forward__euler_8c.html":[16,0,16,3],
"d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,3,4],
"d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,16,3,1],
"d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4":[16,0,16,3,5],
"d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,16,3,0],
"d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9":[16,0,16,3,2],
"d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350":[16,0,16,3,3],
"d4/d11/structstack.html":[15,0,36],
"d4/d2d/struct_c_array.html":[15,0,7],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html":[1],
@ -243,11 +243,11 @@ var NAVTREEINDEX0 =
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md7":[1,5,0],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md8":[1,5,1],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md9":[1,5,2],
"d4/d68/qr__decompose_8h.html":[16,0,15,6],
"d4/d68/qr__decompose_8h.html#a2ed4977f38642dca8b10c16a823c740b":[16,0,15,6,4],
"d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05":[16,0,15,6,2],
"d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56":[16,0,15,6,1],
"d4/d68/qr__decompose_8h.html#a5ee39e7c8fce8a604dcf7009ce101c02":[16,0,15,6,5],
"d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a":[16,0,15,6,0],
"d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212":[16,0,15,6,3]
"d4/d68/qr__decompose_8h.html":[16,0,16,6],
"d4/d68/qr__decompose_8h.html#a2ed4977f38642dca8b10c16a823c740b":[16,0,16,6,4],
"d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05":[16,0,16,6,2],
"d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56":[16,0,16,6,1],
"d4/d68/qr__decompose_8h.html#a5ee39e7c8fce8a604dcf7009ce101c02":[16,0,16,6,5],
"d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a":[16,0,16,6,0],
"d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212":[16,0,16,6,3]
};

View File

@ -1,6 +1,6 @@
var NAVTREEINDEX1 =
{
"d4/d68/qr__decompose_8h_source.html":[16,0,15,6],
"d4/d68/qr__decompose_8h_source.html":[16,0,16,6],
"d4/d69/group__dual__quats.html":[14,0,3],
"d4/d69/group__dual__quats.html#ga27005601c47e5bb7aafe77659e76c88f":[14,0,3,1],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html":[15,0,25],
@ -11,56 +11,56 @@ var NAVTREEINDEX1 =
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a7f42967fd6562d77ac03445ea6e36a3d":[15,0,25,0],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a934ad84d159c35b24ff54f7eceb1c6be":[15,0,25,1],
"d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#aa296b903d0e2ac54acaa7c305bae8007":[15,0,25,4],
"d4/d7b/problem__6_2sol_8c.html":[16,0,17,19,0],
"d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,19,0,0],
"d4/d83/problem__401_2sol1_8c.html":[16,0,17,17,0],
"d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788":[16,0,17,17,0,6],
"d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,17,0,4],
"d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456":[16,0,17,17,0,3],
"d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215":[16,0,17,17,0,2],
"d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077":[16,0,17,17,0,0],
"d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be":[16,0,17,17,0,5],
"d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3":[16,0,17,17,0,1],
"d4/d99/fibonacci__fast_8c.html":[16,0,13,4],
"d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,13,4,1],
"d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3":[16,0,13,4,0],
"d4/d99/ode__semi__implicit__euler_8c.html":[16,0,15,5],
"d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,15,5,2],
"d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb":[16,0,15,5,5],
"d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,15,5,1],
"d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4":[16,0,15,5,3],
"d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,15,5,0],
"d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55":[16,0,15,5,4],
"d4/dbd/problem__23_2sol2_8c.html":[16,0,17,12,1],
"d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b":[16,0,17,12,1,1],
"d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56":[16,0,17,12,1,2],
"d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[16,0,17,12,1,3],
"d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,12,1,4],
"d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[16,0,17,12,1,0],
"d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06":[16,0,17,12,1,5],
"d4/d7b/problem__6_2sol_8c.html":[16,0,18,19,0],
"d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,19,0,0],
"d4/d83/problem__401_2sol1_8c.html":[16,0,18,17,0],
"d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788":[16,0,18,17,0,6],
"d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,17,0,4],
"d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456":[16,0,18,17,0,3],
"d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215":[16,0,18,17,0,2],
"d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077":[16,0,18,17,0,0],
"d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be":[16,0,18,17,0,5],
"d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3":[16,0,18,17,0,1],
"d4/d99/fibonacci__fast_8c.html":[16,0,14,4],
"d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,14,4,1],
"d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3":[16,0,14,4,0],
"d4/d99/ode__semi__implicit__euler_8c.html":[16,0,16,5],
"d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,5,2],
"d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb":[16,0,16,5,5],
"d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a":[16,0,16,5,1],
"d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4":[16,0,16,5,3],
"d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09":[16,0,16,5,0],
"d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55":[16,0,16,5,4],
"d4/dbd/problem__23_2sol2_8c.html":[16,0,18,12,1],
"d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b":[16,0,18,12,1,1],
"d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56":[16,0,18,12,1,2],
"d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[16,0,18,12,1,3],
"d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,12,1,4],
"d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[16,0,18,12,1,0],
"d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06":[16,0,18,12,1,5],
"d4/dcb/md_hash__r_e_a_d_m_e.html":[9],
"d4/dcc/strong__number_8c.html":[16,0,13,9],
"d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5":[16,0,13,9,0],
"d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,13,9,2],
"d4/dcc/strong__number_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,9,1],
"d4/dcc/strong__number_8c.html":[16,0,14,9],
"d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5":[16,0,14,9,0],
"d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,14,9,2],
"d4/dcc/strong__number_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,9,1],
"d4/dd4/struct_graph.html":[15,0,16],
"d4/dd9/structtrie.html":[15,0,43],
"d4/de3/hash__djb2_8c.html":[14,1,2],
"d4/dea/problem__14_2sol1_8c.html":[16,0,17,4,0],
"d4/dea/problem__14_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,4,0,1],
"d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80":[16,0,17,4,0,0],
"d4/dea/problem__14_2sol1_8c.html":[16,0,18,4,0],
"d4/dea/problem__14_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,4,0,1],
"d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80":[16,0,18,4,0,0],
"d4/dfe/struct_dict.html":[15,0,10],
"d5/d23/qr__decomposition_8c.html":[16,0,15,7],
"d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,15,7,0],
"d5/d38/bubble__sort__recursion_8c.html":[16,0,19,3],
"d5/d38/bubble__sort__recursion_8c.html#aa8989f6c9bfd1f040854fa18b180114f":[16,0,19,3,0],
"d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,19,3,2],
"d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,19,3,3],
"d5/d38/bubble__sort__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,3,1],
"d5/d3d/problem__5_2sol2_8c.html":[16,0,17,18,1],
"d5/d3d/problem__5_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,18,1,1],
"d5/d3d/problem__5_2sol2_8c.html#aa7cfa5a28d00d93ec48fab9c3fd5812f":[16,0,17,18,1,0],
"d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6":[16,0,17,18,1,2],
"d5/d23/qr__decomposition_8c.html":[16,0,16,7],
"d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,7,0],
"d5/d38/bubble__sort__recursion_8c.html":[16,0,20,3],
"d5/d38/bubble__sort__recursion_8c.html#aa8989f6c9bfd1f040854fa18b180114f":[16,0,20,3,0],
"d5/d38/bubble__sort__recursion_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,20,3,2],
"d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,20,3,3],
"d5/d38/bubble__sort__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,3,1],
"d5/d3d/problem__5_2sol2_8c.html":[16,0,18,18,1],
"d5/d3d/problem__5_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,18,1,1],
"d5/d3d/problem__5_2sol2_8c.html#aa7cfa5a28d00d93ec48fab9c3fd5812f":[16,0,18,18,1,0],
"d5/d3d/problem__5_2sol2_8c.html#adb59595677da81f071c34f3847fdbaa6":[16,0,18,18,1,2],
"d5/d4c/group__sorting.html":[14,5],
"d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8":[14,5,1],
"d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8":[14,5,8],
@ -73,10 +73,10 @@ var NAVTREEINDEX1 =
"d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f":[14,5,7],
"d5/d5c/test__min__printf_8c.html":[16,0,4,4],
"d5/d5c/test__min__printf_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,4,4,0],
"d5/d7c/problem__5_2sol3_8c.html":[16,0,17,18,2],
"d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d":[16,0,17,18,2,0],
"d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,18,2,2],
"d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,17,18,2,1],
"d5/d7c/problem__5_2sol3_8c.html":[16,0,18,18,2],
"d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d":[16,0,18,18,2,0],
"d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,18,2,2],
"d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,18,18,2,1],
"d5/d7e/struct_t.html":[15,0,40],
"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],
@ -97,6 +97,8 @@ var NAVTREEINDEX1 =
"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/da1/structnode.html":[15,0,28],
"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,28,6],
"d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,28,3],
@ -114,13 +116,13 @@ var NAVTREEINDEX1 =
"d5/db4/structvec__3d__.html#a3339a40de7385fa55bee30be81c098c6":[14,0,0,0,2],
"d5/db4/structvec__3d__.html#a53462a5a195c9e16fb584f73fd66c3d0":[14,0,0,0,0],
"d5/db4/structvec__3d__.html#a76098d39a382838df3b4b48c3443413b":[14,0,0,0,1],
"d5/db8/vectors__3d_8c.html":[16,0,7,2],
"d5/db8/vectors__3d_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,7,2,3],
"d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,7,2,5],
"d5/de2/sentinel__linear__search_8c.html":[16,0,18,5],
"d5/de2/sentinel__linear__search_8c.html#a16a7a1ef83db52643fe23d48280065ce":[16,0,18,5,1],
"d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,5,2],
"d5/de2/sentinel__linear__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,5,0],
"d5/db8/vectors__3d_8c.html":[16,0,8,2],
"d5/db8/vectors__3d_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,8,2,3],
"d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,8,2,5],
"d5/de2/sentinel__linear__search_8c.html":[16,0,19,5],
"d5/de2/sentinel__linear__search_8c.html#a16a7a1ef83db52643fe23d48280065ce":[16,0,19,5,1],
"d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,5,2],
"d5/de2/sentinel__linear__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,5,0],
"d5/df4/group__sudoku.html":[14,4],
"d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1":[14,4,3],
"d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f":[14,4,2],
@ -129,42 +131,42 @@ var NAVTREEINDEX1 =
"d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1":[14,4,6],
"d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55":[14,4,5],
"d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc":[14,4,7],
"d6/d1b/sol4_8c.html":[16,0,17,0,3],
"d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,0,3,0],
"d6/d1b/sol4_8c.html":[16,0,18,0,3],
"d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,0,3,0],
"d6/d2b/tcp__half__duplex__server_8c.html":[16,0,1,7],
"d6/d2b/tcp__half__duplex__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,7,0],
"d6/d2b/tcp__half__duplex__server_8c.html#a7e15c8e2885871839fc2b820dfbdb4ce":[16,0,1,7,1],
"d6/d2b/tcp__half__duplex__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,7,2],
"d6/d2e/cartesian__to__polar_8c.html":[16,0,13,1],
"d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e":[16,0,13,1,0],
"d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60":[16,0,13,1,1],
"d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,13,1,3],
"d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,1,2],
"d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70":[16,0,13,1,4],
"d6/d3d/factorial__large__number_8c.html":[16,0,13,3],
"d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,13,3,4],
"d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d":[16,0,13,3,1],
"d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae":[16,0,13,3,3],
"d6/d3d/factorial__large__number_8c.html#ace5f6aa21955d4e4bdc89228c2f91234":[16,0,13,3,6],
"d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e":[16,0,13,3,5],
"d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3":[16,0,13,3,2],
"d6/d2e/cartesian__to__polar_8c.html":[16,0,14,1],
"d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e":[16,0,14,1,0],
"d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60":[16,0,14,1,1],
"d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,14,1,3],
"d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,1,2],
"d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70":[16,0,14,1,4],
"d6/d3d/factorial__large__number_8c.html":[16,0,14,3],
"d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,14,3,4],
"d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d":[16,0,14,3,1],
"d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae":[16,0,14,3,3],
"d6/d3d/factorial__large__number_8c.html#ace5f6aa21955d4e4bdc89228c2f91234":[16,0,14,3,6],
"d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e":[16,0,14,3,5],
"d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3":[16,0,14,3,2],
"d6/d42/structdynamic__array.html":[15,0,12],
"d6/d48/isogram_8h_source.html":[16,0,5,2,0],
"d6/d64/problem__7_2sol2_8c.html":[16,0,17,20,1],
"d6/d64/problem__7_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,20,1,0],
"d6/d76/k__means__clustering_8c.html":[16,0,12,1],
"d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,12,1,6],
"d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a":[16,0,12,1,4],
"d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,12,1,5],
"d6/d76/k__means__clustering_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,12,1,3],
"d6/d48/isogram_8h_source.html":[16,0,6,2,0],
"d6/d64/problem__7_2sol2_8c.html":[16,0,18,20,1],
"d6/d64/problem__7_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,20,1,0],
"d6/d76/k__means__clustering_8c.html":[16,0,13,1],
"d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,13,1,6],
"d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a":[16,0,13,1,4],
"d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,13,1,5],
"d6/d76/k__means__clustering_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,1,3],
"d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html":[10],
"d6/d7b/jump__search_8c.html":[16,0,18,3],
"d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e":[16,0,18,3,0],
"d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,18,3,3],
"d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,3,2],
"d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603":[16,0,18,3,1],
"d6/d88/problem__16_2sol1_8c.html":[16,0,17,6,0],
"d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,6,0,0],
"d6/d7b/jump__search_8c.html":[16,0,19,3],
"d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e":[16,0,19,3,0],
"d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,19,3,3],
"d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,3,2],
"d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603":[16,0,19,3,1],
"d6/d88/problem__16_2sol1_8c.html":[16,0,18,6,0],
"d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,6,0,0],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html":[3],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md18":[3,0],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md19":[3,1],
@ -185,13 +187,13 @@ var NAVTREEINDEX1 =
"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/ded/shell__sort2_8c.html":[16,0,19,11],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,19,11,0],
"d6/ded/shell__sort2_8c.html":[16,0,20,11],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,20,11,0],
"d6/df3/graph_8h_source.html":[16,0,3,4,0],
"d7/d0c/hash__sdbm_8c.html":[14,1,3],
"d7/d1f/problem__12_2sol1_8c.html":[16,0,17,2,0],
"d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,2,0,1],
"d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222":[16,0,17,2,0,0],
"d7/d1f/problem__12_2sol1_8c.html":[16,0,18,2,0],
"d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,2,0,1],
"d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222":[16,0,18,2,0,0],
"d7/d3b/group__hash.html":[14,1],
"d7/d3b/group__hash.html#ga1ac362fa25f7c35d104205985f8e754b":[14,1,7],
"d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0":[14,1,13],
@ -203,38 +205,38 @@ var NAVTREEINDEX1 =
"d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453":[14,1,12],
"d7/d3b/group__hash.html#gad451622bbdca271edfa8e0d98ca422f2":[14,1,10],
"d7/d3b/group__hash.html#gae4836b42b998b336298f3b19dcc9cdeb":[14,1,14],
"d7/d50/qr__eigen__values_8c.html":[16,0,15,8],
"d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70":[16,0,15,8,0],
"d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,15,8,7],
"d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb":[16,0,15,8,3],
"d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0":[16,0,15,8,6],
"d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,15,8,4],
"d7/d50/qr__eigen__values_8c.html#a5835240036dc02ee9a13e65c559fb907":[16,0,15,8,5],
"d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0":[16,0,15,8,2],
"d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40":[16,0,15,8,1],
"d7/d90/rna__transcription_8h_source.html":[16,0,5,3,0],
"d7/d91/problem__15_2sol1_8c.html":[16,0,17,5,0],
"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,5,0,0],
"d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6":[16,0,17,5,0,1],
"d7/d98/spirograph_8c.html":[16,0,8,0],
"d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3":[16,0,8,0,2],
"d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,8,0,1],
"d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e":[16,0,8,0,0],
"d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f":[16,0,8,0,3],
"d7/d50/qr__eigen__values_8c.html":[16,0,16,8],
"d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70":[16,0,16,8,0],
"d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0":[16,0,16,8,7],
"d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb":[16,0,16,8,3],
"d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0":[16,0,16,8,6],
"d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,8,4],
"d7/d50/qr__eigen__values_8c.html#a5835240036dc02ee9a13e65c559fb907":[16,0,16,8,5],
"d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0":[16,0,16,8,2],
"d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40":[16,0,16,8,1],
"d7/d90/rna__transcription_8h_source.html":[16,0,6,3,0],
"d7/d91/problem__15_2sol1_8c.html":[16,0,18,5,0],
"d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,5,0,0],
"d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6":[16,0,18,5,0,1],
"d7/d98/spirograph_8c.html":[16,0,9,0],
"d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3":[16,0,9,0,2],
"d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,9,0,1],
"d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e":[16,0,9,0,0],
"d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f":[16,0,9,0,3],
"d7/db5/md_exercism__r_e_a_d_m_e.html":[8],
"d7/dd3/problem__3_2sol1_8c.html":[16,0,17,15,0],
"d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305":[16,0,17,15,0,0],
"d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,15,0,1],
"d7/dd3/problem__3_2sol1_8c.html":[16,0,18,15,0],
"d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305":[16,0,18,15,0,0],
"d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,15,0,1],
"d7/dd8/c__atoi__str__to__integer_8c.html":[16,0,2,0],
"d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,2,0,1],
"d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be":[16,0,2,0,2],
"d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f":[16,0,2,0,0],
"d7/ddb/problem__23_2sol1_8c.html":[16,0,17,12,0],
"d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b":[16,0,17,12,0,1],
"d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[16,0,17,12,0,3],
"d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,12,0,4],
"d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17":[16,0,17,12,0,2],
"d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[16,0,17,12,0,0],
"d7/ddb/problem__23_2sol1_8c.html":[16,0,18,12,0],
"d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b":[16,0,18,12,0,1],
"d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[16,0,18,12,0,3],
"d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,12,0,4],
"d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17":[16,0,18,12,0,2],
"d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[16,0,18,12,0,0],
"d7/de0/stack_8h_source.html":[16,0,3,9,1],
"d7/dfd/structdual__quat__.html":[14,0,3,0],
"d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d":[14,0,3,0,0],
@ -246,8 +248,6 @@ var NAVTREEINDEX1 =
"d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,2,3,2],
"d8/d30/decimal__to__binary__recursion_8c.html#acbbe6358ec95b3201865a72b2ac522c8":[16,0,2,3,0],
"d8/d30/decimal__to__binary__recursion_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,3,1],
"d8/d32/problem__25_2sol1_8c.html":[16,0,17,13,0],
"d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61":[16,0,17,13,0,0],
"d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,17,13,0,3],
"d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,17,13,0,2]
"d8/d32/problem__25_2sol1_8c.html":[16,0,18,13,0],
"d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61":[16,0,18,13,0,0]
};

View File

@ -1,16 +1,18 @@
var NAVTREEINDEX2 =
{
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,17,13,0,4],
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,17,13,0,1],
"d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,13,0,3],
"d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,18,13,0,2],
"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,18,13,0,4],
"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,18,13,0,1],
"d8/d38/queue_8h_source.html":[16,0,3,4,1],
"d8/d71/group__k__means.html":[14,2,1],
"d8/d71/group__k__means.html#gad339c41d3ee9e6729aca9e9ab3f7d2d9":[14,2,1,3],
"d8/d71/group__k__means.html#gadee39a3f17bf5144df5592e48dbfc9f7":[14,2,1,2],
"d8/d71/group__k__means.html#gaf6259432561e794dea0e060f482d15e2":[14,2,1,4],
"d8/d75/fibonacci__formula_8c.html":[16,0,13,5],
"d8/d75/fibonacci__formula_8c.html#a4d369ae048e0ccc7f515a243533cd946":[16,0,13,5,0],
"d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,13,5,2],
"d8/d75/fibonacci__formula_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,5,1],
"d8/d75/fibonacci__formula_8c.html":[16,0,14,5],
"d8/d75/fibonacci__formula_8c.html#a4d369ae048e0ccc7f515a243533cd946":[16,0,14,5,0],
"d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,14,5,2],
"d8/d75/fibonacci__formula_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,5,1],
"d8/d7a/structtnode.html":[15,0,42],
"d8/d7c/dict_8h_source.html":[16,0,3,2,0],
"d8/d81/md_project_euler__r_e_a_d_m_e.html":[12],
@ -24,8 +26,8 @@ var NAVTREEINDEX2 =
"d8/dca/udp__server_8c.html#a3e937c42922f7601edb17b747602c471":[16,0,1,9,0],
"d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,9,1],
"d8/dca/udp__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,9,2],
"d8/de0/problem__9_2sol2_8c.html":[16,0,17,22,1],
"d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,22,1,0],
"d8/de0/problem__9_2sol2_8c.html":[16,0,18,22,1],
"d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,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],
@ -35,16 +37,16 @@ var NAVTREEINDEX2 =
"d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[14,0,1,0,2],
"d9/d8b/structmat__3x3__.html#a8d7ae8fbcc408e3c30e9d64bbd28feaf":[14,0,1,0,1],
"d9/d8b/structmat__3x3__.html#ac74f33a2e1ad1f6db74d94807cf1f64e":[14,0,1,0,0],
"d9/da7/problem__10_2sol2_8c.html":[16,0,17,1,1],
"d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,17,1,1,0],
"d9/da7/problem__10_2sol2_8c.html":[16,0,18,1,1],
"d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,1,1,0],
"d9/dc9/hash__crc32_8c.html":[14,1,1],
"d9/dcc/prim_8c.html":[16,0,9,0],
"d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853":[16,0,9,0,3],
"d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,9,0,0],
"d9/dcc/prim_8c.html#a72ec66b10f86d67064d34f2b2717fdfc":[16,0,9,0,2],
"d9/dcc/prim_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089":[16,0,9,0,1],
"d9/dcc/prim_8c.html#addac7a8c7bfd3e5573dad1f6aeff7768":[16,0,9,0,5],
"d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c":[16,0,9,0,4],
"d9/dcc/prim_8c.html":[16,0,10,0],
"d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853":[16,0,10,0,3],
"d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,10,0,0],
"d9/dcc/prim_8c.html#a72ec66b10f86d67064d34f2b2717fdfc":[16,0,10,0,2],
"d9/dcc/prim_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089":[16,0,10,0,1],
"d9/dcc/prim_8c.html#addac7a8c7bfd3e5573dad1f6aeff7768":[16,0,10,0,5],
"d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c":[16,0,10,0,4],
"d9/dd7/struct__cantor__set.html":[15,0,1],
"d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1":[15,0,1,1],
"d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03":[15,0,1,2],
@ -95,27 +97,27 @@ var NAVTREEINDEX2 =
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[14,2,0,7],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[14,2,0,9],
"da/d2a/group__adaline.html#gadb1a7acb555ad62daaf3806bf2fed036":[14,2,0,6],
"da/d35/problem__1_2sol1_8c.html":[16,0,17,0,0],
"da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,0,0,0],
"da/d38/durand__kerner__roots_8c.html":[16,0,15,0],
"da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52":[16,0,15,0,1],
"da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c":[16,0,15,0,4],
"da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,15,0,3],
"da/d38/durand__kerner__roots_8c.html#a46197e91f478e99a2229562aaaac311e":[16,0,15,0,2],
"da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689":[16,0,15,0,0],
"da/d56/problem__1_2sol3_8c.html":[16,0,17,0,2],
"da/d56/problem__1_2sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,17,0,2,0],
"da/d6c/exponential__search_8c.html":[16,0,18,1],
"da/d6c/exponential__search_8c.html#a82d4de0907b9601a376febf50955bacd":[16,0,18,1,2],
"da/d6c/exponential__search_8c.html#aa5e9be47d76a4e1865914bcb7a2a7479":[16,0,18,1,0],
"da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,1,4],
"da/d6c/exponential__search_8c.html#aae97ef76c065e91c188f1f8c8076869a":[16,0,18,1,1],
"da/d6c/exponential__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,1,3],
"da/d35/problem__1_2sol1_8c.html":[16,0,18,0,0],
"da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,0,0,0],
"da/d38/durand__kerner__roots_8c.html":[16,0,16,0],
"da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52":[16,0,16,0,1],
"da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c":[16,0,16,0,4],
"da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,0,3],
"da/d38/durand__kerner__roots_8c.html#a46197e91f478e99a2229562aaaac311e":[16,0,16,0,2],
"da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689":[16,0,16,0,0],
"da/d56/problem__1_2sol3_8c.html":[16,0,18,0,2],
"da/d56/problem__1_2sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,18,0,2,0],
"da/d6c/exponential__search_8c.html":[16,0,19,1],
"da/d6c/exponential__search_8c.html#a82d4de0907b9601a376febf50955bacd":[16,0,19,1,2],
"da/d6c/exponential__search_8c.html#aa5e9be47d76a4e1865914bcb7a2a7479":[16,0,19,1,0],
"da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,1,4],
"da/d6c/exponential__search_8c.html#aae97ef76c065e91c188f1f8c8076869a":[16,0,19,1,1],
"da/d6c/exponential__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,1,3],
"da/d90/stack__linked__list_2stack_8h_source.html":[16,0,3,9,0,0],
"da/d93/prime_8c.html":[16,0,13,7],
"da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f":[16,0,13,7,0],
"da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,13,7,2],
"da/d93/prime_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,7,1],
"da/d93/prime_8c.html":[16,0,14,7],
"da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f":[16,0,14,7,0],
"da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,14,7,2],
"da/d93/prime_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,7,1],
"da/d96/infix__to__postfix2_8c.html":[16,0,2,6],
"da/d96/infix__to__postfix2_8c.html#a02d1bf0ff997efc46ba6fd0ec7952952":[16,0,2,6,5],
"da/d96/infix__to__postfix2_8c.html#a2d1c13296ce9c42bb5dd7d834e2802bf":[16,0,2,6,8],
@ -142,11 +144,11 @@ var NAVTREEINDEX2 =
"da/de6/udp__client_8c.html#a3e937c42922f7601edb17b747602c471":[16,0,1,8,0],
"da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,8,1],
"da/de6/udp__client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,8,2],
"db/d01/problem__13_2sol1_8c.html":[16,0,17,3,0],
"db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319":[16,0,17,3,0,3],
"db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,3,0,2],
"db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8":[16,0,17,3,0,1],
"db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2":[16,0,17,3,0,0],
"db/d01/problem__13_2sol1_8c.html":[16,0,18,3,0],
"db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319":[16,0,18,3,0,3],
"db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,3,0,2],
"db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8":[16,0,18,3,0,1],
"db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2":[16,0,18,3,0,0],
"db/d0c/infix__to__postfix_8c.html":[16,0,2,5],
"db/d0c/infix__to__postfix_8c.html#a613462735d30cae1b85b606ecab30554":[16,0,2,5,7],
"db/d0c/infix__to__postfix_8c.html#a92af69ffc1e1f965ebce6a44672e96b1":[16,0,2,5,1],
@ -155,11 +157,11 @@ var NAVTREEINDEX2 =
"db/d0c/infix__to__postfix_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,5,5],
"db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021":[16,0,2,5,3],
"db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b":[16,0,2,5,4],
"db/d80/problem__20_2sol1_8c.html":[16,0,17,9,0],
"db/d80/problem__20_2sol1_8c.html#a0dd8af03e6cc8187e996db564ff90960":[16,0,17,9,0,2],
"db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,9,0,3],
"db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[16,0,17,9,0,4],
"db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32":[16,0,17,9,0,1],
"db/d80/problem__20_2sol1_8c.html":[16,0,18,9,0],
"db/d80/problem__20_2sol1_8c.html#a0dd8af03e6cc8187e996db564ff90960":[16,0,18,9,0,2],
"db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,9,0,3],
"db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[16,0,18,9,0,4],
"db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32":[16,0,18,9,0,1],
"db/d84/malloc__dbg_8c.html":[16,0,4,0],
"db/d84/malloc__dbg_8c.html#a062aa89cafd39a97971a2eb22653ff2a":[16,0,4,0,2],
"db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797":[16,0,4,0,8],
@ -179,48 +181,53 @@ var NAVTREEINDEX2 =
"db/d8b/struct_node.html#ad0976834843c7618677d22a10c495b36":[15,0,27,2],
"db/d8b/struct_node.html#af99e7102380da88d7c079fa264230cf4":[15,0,27,4],
"db/d8b/struct_node.html#afa6ccc6414d3e0bcacb715dcdf764bca":[15,0,27,6],
"db/ddb/hello__world_8h_source.html":[16,0,5,1,0],
"db/ddf/insertion__sort_8c.html":[16,0,19,5],
"db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb":[16,0,19,5,0],
"db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,5,1],
"db/de2/naval__battle_8c.html":[16,0,6,0],
"db/de2/naval__battle_8c.html#a23e98ed36ca08c1b4bb86c86f48f6e70":[16,0,6,0,9],
"db/de2/naval__battle_8c.html#a2d65de2c86c7015d7ca400dfca0f25dc":[16,0,6,0,5],
"db/de2/naval__battle_8c.html#a3889e1ee574e03ffdde8804180d57543":[16,0,6,0,8],
"db/de2/naval__battle_8c.html#a3f7d3dc5931fba6164e73057859094d9":[16,0,6,0,3],
"db/de2/naval__battle_8c.html#a4a5686c91f144d07eff1c6576303962d":[16,0,6,0,10],
"db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef":[16,0,6,0,4],
"db/de2/naval__battle_8c.html#a59224afd73372b4f52415203e315f6e1":[16,0,6,0,1],
"db/de2/naval__battle_8c.html#a5c84d83e31ca6a320b6ea8081402686a":[16,0,6,0,6],
"db/de2/naval__battle_8c.html#a7c5042bd35c4186b06ae28f06635b40e":[16,0,6,0,11],
"db/de2/naval__battle_8c.html#ab6e31f8df36de67ff967859069ccfc56":[16,0,6,0,0],
"db/de2/naval__battle_8c.html#ad527fa96e729742a231c4535e112526a":[16,0,6,0,7],
"db/de2/naval__battle_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,6,0,2],
"db/ddb/hello__world_8h_source.html":[16,0,6,1,0],
"db/ddf/insertion__sort_8c.html":[16,0,20,5],
"db/ddf/insertion__sort_8c.html#a0d6c227641a5e0dae580b3a18df241fb":[16,0,20,5,0],
"db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,5,1],
"db/de1/lcs_8c.html":[16,0,5,0],
"db/de1/lcs_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,5,0,2],
"db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0":[16,0,5,0,0],
"db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,5,0,3],
"db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6":[16,0,5,0,1],
"db/de2/naval__battle_8c.html":[16,0,7,0],
"db/de2/naval__battle_8c.html#a23e98ed36ca08c1b4bb86c86f48f6e70":[16,0,7,0,9],
"db/de2/naval__battle_8c.html#a2d65de2c86c7015d7ca400dfca0f25dc":[16,0,7,0,5],
"db/de2/naval__battle_8c.html#a3889e1ee574e03ffdde8804180d57543":[16,0,7,0,8],
"db/de2/naval__battle_8c.html#a3f7d3dc5931fba6164e73057859094d9":[16,0,7,0,3],
"db/de2/naval__battle_8c.html#a4a5686c91f144d07eff1c6576303962d":[16,0,7,0,10],
"db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef":[16,0,7,0,4],
"db/de2/naval__battle_8c.html#a59224afd73372b4f52415203e315f6e1":[16,0,7,0,1],
"db/de2/naval__battle_8c.html#a5c84d83e31ca6a320b6ea8081402686a":[16,0,7,0,6],
"db/de2/naval__battle_8c.html#a7c5042bd35c4186b06ae28f06635b40e":[16,0,7,0,11],
"db/de2/naval__battle_8c.html#ab6e31f8df36de67ff967859069ccfc56":[16,0,7,0,0],
"db/de2/naval__battle_8c.html#ad527fa96e729742a231c4535e112526a":[16,0,7,0,7],
"db/de2/naval__battle_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,7,0,2],
"dc/d18/structsudoku.html":[14,4,0],
"dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56":[14,4,0,2],
"dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129":[14,4,0,1],
"dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded":[14,4,0,0],
"dc/d2e/lu__decompose_8c.html":[16,0,15,1],
"dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a":[16,0,15,1,0],
"dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,15,1,2],
"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4":[16,0,15,1,1],
"dc/d32/problem__5_2sol1_8c.html":[16,0,17,18,0],
"dc/d32/problem__5_2sol1_8c.html#a24b470eef1ce1da4401c03ae250f93e3":[16,0,17,18,0,0],
"dc/d32/problem__5_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,18,0,1],
"dc/d39/selection__sort__recursive_8c.html":[16,0,19,10],
"dc/d39/selection__sort__recursive_8c.html#a3f04d850b94a34dcaaed0e7bc7475241":[16,0,19,10,2],
"dc/d39/selection__sort__recursive_8c.html#aa2bc8bdd2e8ce289a6b8ef528fd1a534":[16,0,19,10,0],
"dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,10,4],
"dc/d39/selection__sort__recursive_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,19,10,3],
"dc/d39/selection__sort__recursive_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,10,1],
"dc/d47/realtime__stats_8c.html":[16,0,15,9],
"dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96":[16,0,15,9,2],
"dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,15,9,0],
"dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628":[16,0,15,9,1],
"dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd":[16,0,15,9,3],
"dc/d63/problem__8_2sol1_8c.html":[16,0,17,21,0],
"dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,17,21,0,1],
"dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd":[16,0,17,21,0,0],
"dc/d2e/lu__decompose_8c.html":[16,0,16,1],
"dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a":[16,0,16,1,0],
"dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,1,2],
"dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4":[16,0,16,1,1],
"dc/d32/problem__5_2sol1_8c.html":[16,0,18,18,0],
"dc/d32/problem__5_2sol1_8c.html#a24b470eef1ce1da4401c03ae250f93e3":[16,0,18,18,0,0],
"dc/d32/problem__5_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,18,0,1],
"dc/d39/selection__sort__recursive_8c.html":[16,0,20,10],
"dc/d39/selection__sort__recursive_8c.html#a3f04d850b94a34dcaaed0e7bc7475241":[16,0,20,10,2],
"dc/d39/selection__sort__recursive_8c.html#aa2bc8bdd2e8ce289a6b8ef528fd1a534":[16,0,20,10,0],
"dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,10,4],
"dc/d39/selection__sort__recursive_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,20,10,3],
"dc/d39/selection__sort__recursive_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,10,1],
"dc/d47/realtime__stats_8c.html":[16,0,16,9],
"dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96":[16,0,16,9,2],
"dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,9,0],
"dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628":[16,0,16,9,1],
"dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd":[16,0,16,9,3],
"dc/d63/problem__8_2sol1_8c.html":[16,0,18,21,0],
"dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,21,0,1],
"dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd":[16,0,18,21,0,0],
"dc/d64/md__coding_guidelines.html":[2],
"dc/d64/md__coding_guidelines.html#autotoc_md14":[2,0],
"dc/d64/md__coding_guidelines.html#autotoc_md16":[2,1],
@ -228,26 +235,19 @@ var NAVTREEINDEX2 =
"dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564":[15,0,0,0],
"dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008":[15,0,0,2],
"dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b":[15,0,0,1],
"dc/d80/cantor__set_8c.html":[16,0,13,0],
"dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97":[16,0,13,0,5],
"dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94":[16,0,13,0,1],
"dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab":[16,0,13,0,4],
"dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d":[16,0,13,0,2],
"dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089":[16,0,13,0,3],
"dc/d80/collatz_8c.html":[16,0,13,2],
"dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,13,2,0],
"dc/d80/cantor__set_8c.html":[16,0,14,0],
"dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97":[16,0,14,0,5],
"dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94":[16,0,14,0,1],
"dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab":[16,0,14,0,4],
"dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d":[16,0,14,0,2],
"dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089":[16,0,14,0,3],
"dc/d80/collatz_8c.html":[16,0,14,2],
"dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,14,2,0],
"dc/d9a/group__quats.html":[14,0,2],
"dc/d9a/group__quats.html#ga1afd165100e9b02b86e3bd11b50f3b06":[14,0,2,4],
"dc/d9a/group__quats.html#ga4779f448daaf806ce5e750c13b3e0965":[14,0,2,5],
"dc/d9a/group__quats.html#ga8cc5e5b7a5fa492423ecf034c8bb52bd":[14,0,2,2],
"dc/d9a/group__quats.html#gaacd70a16b61dd47a19eb5fb729c2669b":[14,0,2,3],
"dc/d9a/group__quats.html#gaf5ad0f9c4f0facc5a9c3735a178156b1":[14,0,2,6],
"dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html":[13],
"dc/de3/hash__set_8h_source.html":[16,0,3,5,0],
"dc/de5/structsubset.html":[15,0,38],
"dd/d06/structsegment__tree.html":[15,0,34],
"dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,34,2],
"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3],
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0],
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,34,4]
"dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html":[13]
};

View File

@ -1,11 +1,18 @@
var NAVTREEINDEX3 =
{
"dc/de3/hash__set_8h_source.html":[16,0,3,5,0],
"dc/de5/structsubset.html":[15,0,38],
"dd/d06/structsegment__tree.html":[15,0,34],
"dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,34,2],
"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3],
"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0],
"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,34,4],
"dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[15,0,34,1],
"dd/d08/newton__raphson__root_8c.html":[16,0,15,2],
"dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,15,2,3],
"dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925":[16,0,15,2,2],
"dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337":[16,0,15,2,1],
"dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689":[16,0,15,2,0],
"dd/d08/newton__raphson__root_8c.html":[16,0,16,2],
"dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,2,3],
"dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925":[16,0,16,2,2],
"dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337":[16,0,16,2,1],
"dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689":[16,0,16,2,0],
"dd/d10/struct_stack.html":[15,0,35],
"dd/d10/struct_stack.html#a856ca6f4a9ffde43f0cb3b43cb4d044d":[15,0,35,0],
"dd/d10/struct_stack.html#aa16cf0b36f9735ed00bde97a5013adaa":[15,0,35,1],
@ -32,45 +39,45 @@ var NAVTREEINDEX3 =
"dd/d79/remote__command__exec__udp__server_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,2,2],
"dd/d7a/group__matrix.html":[14,0,1],
"dd/d7a/group__matrix.html#ga9f844010cb96591fa94c9d533a500ab7":[14,0,1,1],
"dd/d8b/problem__22_2sol1_8c.html":[16,0,17,11,0],
"dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,11,0,3],
"dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63":[16,0,17,11,0,4],
"dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38":[16,0,17,11,0,1],
"dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d":[16,0,17,11,0,2],
"dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a":[16,0,17,11,0,0],
"dd/d8c/adaline__learning_8c.html":[16,0,12,0],
"dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6":[16,0,12,0,11],
"dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,12,0,8],
"dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1":[16,0,12,0,12],
"dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9":[16,0,12,0,10],
"dd/d8b/problem__22_2sol1_8c.html":[16,0,18,11,0],
"dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,11,0,3],
"dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63":[16,0,18,11,0,4],
"dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38":[16,0,18,11,0,1],
"dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d":[16,0,18,11,0,2],
"dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a":[16,0,18,11,0,0],
"dd/d8c/adaline__learning_8c.html":[16,0,13,0],
"dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6":[16,0,13,0,11],
"dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,13,0,8],
"dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1":[16,0,13,0,12],
"dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9":[16,0,13,0,10],
"dd/d93/client_8c.html":[16,0,1,0],
"dd/d93/client_8c.html#a1e43924adac4ae865aa0acf79710261c":[16,0,1,0,2],
"dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,1,0,0],
"dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2":[16,0,1,0,1],
"dd/d93/client_8c.html#ac17020a38607ab29ce18939d5194a32a":[16,0,1,0,3],
"dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,1,0,4],
"dd/d95/word__count_8h_source.html":[16,0,5,4,0],
"dd/d95/word__count_8h_source.html":[16,0,6,4,0],
"dd/da2/structbuffer.html":[15,0,6],
"dd/dd3/prime__sieve_8c.html":[16,0,13,8],
"dd/dd3/prime__sieve_8c.html#ac1215a37edfa07d37edf6ec65f2235c7":[16,0,13,8,4],
"dd/de4/bubble__sort_8c.html":[16,0,19,1],
"dd/de4/bubble__sort_8c.html#aa8989f6c9bfd1f040854fa18b180114f":[16,0,19,1,0],
"dd/de4/bubble__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,19,1,2],
"dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,19,1,3],
"dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971":[16,0,19,1,1],
"dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,19,1,4],
"dd/dd3/prime__sieve_8c.html":[16,0,14,8],
"dd/dd3/prime__sieve_8c.html#ac1215a37edfa07d37edf6ec65f2235c7":[16,0,14,8,4],
"dd/de4/bubble__sort_8c.html":[16,0,20,1],
"dd/de4/bubble__sort_8c.html#aa8989f6c9bfd1f040854fa18b180114f":[16,0,20,1,0],
"dd/de4/bubble__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,20,1,2],
"dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,20,1,3],
"dd/de4/bubble__sort_8c.html#ad7ed8cc4603f500d610054680d28b971":[16,0,20,1,1],
"dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,20,1,4],
"dd/de6/roman__numerals__to__decimal_8c.html":[16,0,2,9],
"dd/de6/roman__numerals__to__decimal_8c.html#a1e86fb4466b6a175b910fa19c4a6ea03":[16,0,2,9,1],
"dd/de6/roman__numerals__to__decimal_8c.html#a95b7915cdb0df66a0aae7b769d3bbf88":[16,0,2,9,2],
"dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,2,9,3],
"dd/de6/roman__numerals__to__decimal_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,2,9,0],
"dd/df0/problem__19_2sol1_8c.html":[16,0,17,7,0],
"dd/df0/problem__19_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,7,0,2],
"dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e":[16,0,17,7,0,1],
"dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75":[16,0,17,7,0,0],
"de/d0c/insertion__sort__recursive_8c.html":[16,0,19,6],
"de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,6,2],
"de/d0c/insertion__sort__recursive_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,19,6,0],
"dd/df0/problem__19_2sol1_8c.html":[16,0,18,7,0],
"dd/df0/problem__19_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,7,0,2],
"dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e":[16,0,18,7,0,1],
"dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75":[16,0,18,7,0,0],
"de/d0c/insertion__sort__recursive_8c.html":[16,0,20,6],
"de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,6,2],
"de/d0c/insertion__sort__recursive_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,20,6,0],
"de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html":[5],
"de/d58/structquaternion__.html":[14,0,2,0],
"de/d58/structquaternion__.html#a37819eb7d76c65c37a9c2a63f01f65b2":[14,0,2,0,1],
@ -89,37 +96,37 @@ var NAVTREEINDEX3 =
"de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af":[14,0,0,5],
"de/d7b/group__vec__3d.html#gae4a49e6bdf13df949e8b23c7925bb5f5":[14,0,0,9],
"de/d7b/group__vec__3d.html#gaf9ee870d4922e488bdd3e7262485c270":[14,0,0,1],
"de/dac/sudoku__solver_8c.html":[16,0,14,4],
"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,4,1],
"de/dac/sudoku__solver_8c.html":[16,0,15,4],
"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,4,1],
"de/dce/structmin__heap.html":[15,0,26],
"de/dcf/rot13_8c.html":[16,0,14,2],
"de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,14,2,2],
"de/dcf/rot13_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,2,0],
"de/dcf/rot13_8c.html#aff3bdb59af9eabba91420f23eb01718c":[16,0,14,2,1],
"de/dff/heap__sort__2_8c.html":[16,0,19,4],
"de/dff/heap__sort__2_8c.html#a00cd944b33a5fe5972111ded9b49793c":[16,0,19,4,0],
"de/dff/heap__sort__2_8c.html#a619753b978f962aa2337e1fdb4e59e33":[16,0,19,4,1],
"de/dff/heap__sort__2_8c.html#a672a47d865e7fa18f1ff23001ef4a485":[16,0,19,4,2],
"de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,4,5],
"de/dff/heap__sort__2_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,19,4,4],
"de/dff/heap__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,19,4,3],
"df/d16/palindrome_8c.html":[16,0,13,6],
"df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba":[16,0,13,6,0],
"df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,6,1],
"df/d1a/problem__21_2sol1_8c.html":[16,0,17,10,0],
"df/d1a/problem__21_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,17,10,0,0],
"df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93":[16,0,17,10,0,1],
"de/dcf/rot13_8c.html":[16,0,15,2],
"de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,15,2,2],
"de/dcf/rot13_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,2,0],
"de/dcf/rot13_8c.html#aff3bdb59af9eabba91420f23eb01718c":[16,0,15,2,1],
"de/dff/heap__sort__2_8c.html":[16,0,20,4],
"de/dff/heap__sort__2_8c.html#a00cd944b33a5fe5972111ded9b49793c":[16,0,20,4,0],
"de/dff/heap__sort__2_8c.html#a619753b978f962aa2337e1fdb4e59e33":[16,0,20,4,1],
"de/dff/heap__sort__2_8c.html#a672a47d865e7fa18f1ff23001ef4a485":[16,0,20,4,2],
"de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,4,5],
"de/dff/heap__sort__2_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,20,4,4],
"de/dff/heap__sort__2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,4,3],
"df/d16/palindrome_8c.html":[16,0,14,6],
"df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba":[16,0,14,6,0],
"df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,6,1],
"df/d1a/problem__21_2sol1_8c.html":[16,0,18,10,0],
"df/d1a/problem__21_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,18,10,0,0],
"df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93":[16,0,18,10,0,1],
"df/d27/alaw_8c.html":[16,0,0,0],
"df/d27/alaw_8c.html#a05b49c662c073f89e86804f7856622a0":[16,0,0,0,0],
"df/d27/alaw_8c.html#a093ac72124e3c2268d1150676e63175d":[16,0,0,0,1],
"df/d27/alaw_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,0,0,3],
"df/d27/alaw_8c.html#a751d8e2c1975706e4d876316518c54c4":[16,0,0,0,2],
"df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5":[16,0,0,0,4],
"df/d3b/binary__search_8c.html":[16,0,18,0],
"df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582":[16,0,18,0,0],
"df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,0,2],
"df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032":[16,0,18,0,1],
"df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,18,0,3],
"df/d3b/binary__search_8c.html":[16,0,19,0],
"df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582":[16,0,19,0,0],
"df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,19,0,2],
"df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032":[16,0,19,0,1],
"df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002":[16,0,19,0,3],
"df/d3c/threaded__binary__trees_8c.html":[16,0,3,1,2],
"df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317":[16,0,3,1,2,3],
"df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c":[16,0,3,1,2,9],
@ -130,39 +137,39 @@ var NAVTREEINDEX3 =
"df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb":[16,0,3,1,2,5],
"df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6":[16,0,3,1,2,1],
"df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,1,2,6],
"df/d43/postfix__evaluation_8c.html":[16,0,14,1],
"df/d43/postfix__evaluation_8c.html#a4494492c8fc2509f602acc8228a3b623":[16,0,14,1,1],
"df/d43/postfix__evaluation_8c.html#a791cc5e78425bce611db4e3bdc4b19d5":[16,0,14,1,6],
"df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d":[16,0,14,1,3],
"df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,14,1,5],
"df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,1,2],
"df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,14,1,4],
"df/d43/postfix__evaluation_8c.html":[16,0,15,1],
"df/d43/postfix__evaluation_8c.html#a4494492c8fc2509f602acc8228a3b623":[16,0,15,1,1],
"df/d43/postfix__evaluation_8c.html#a791cc5e78425bce611db4e3bdc4b19d5":[16,0,15,1,6],
"df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d":[16,0,15,1,3],
"df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,15,1,5],
"df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,1,2],
"df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,15,1,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_md71":[11,0],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72":[11,1],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,1,0],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,2],
"df/d83/selection__sort_8c.html":[16,0,19,9],
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,19,9,3],
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,19,9,0],
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,19,9,2],
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[16,0,19,9,1],
"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,1,0],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md76":[11,2],
"df/d83/selection__sort_8c.html":[16,0,20,9],
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,9,3],
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,20,9,0],
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,20,9,2],
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[16,0,20,9,1],
"df/d86/structterm.html":[15,0,41],
"df/d86/structterm.html#a057f161d279d856d11786aa96fc87f74":[15,0,41,2],
"df/d86/structterm.html#a5a730814391f70179da78c657e6e6f7b":[15,0,41,0],
"df/d86/structterm.html#ab7ac49a58cc431c9838c855bf59a243a":[15,0,41,1],
"df/d98/quaternions_8c.html":[16,0,7,1],
"df/da5/problem__9_2sol1_8c.html":[16,0,17,22,0],
"df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,17,22,0,0],
"df/d98/quaternions_8c.html":[16,0,8,1],
"df/da5/problem__9_2sol1_8c.html":[16,0,18,22,0],
"df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,22,0,0],
"df/db3/struct_l.html":[15,0,20],
"df/dc6/acronym_8h_source.html":[16,0,5,0,0],
"df/dc6/acronym_8h_source.html":[16,0,6,0,0],
"df/ddb/structword__count__word.html":[15,0,46],
"df/dea/structdata.html":[15,0,9],
"df/df3/union__find_8c.html":[16,0,14,5],
"df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe":[16,0,14,5,0],
"df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86":[16,0,14,5,1],
"df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,14,5,3],
"df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a":[16,0,14,5,2],
"df/df3/union__find_8c.html":[16,0,15,5],
"df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe":[16,0,15,5,0],
"df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86":[16,0,15,5,1],
"df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,15,5,3],
"df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a":[16,0,15,5,2],
"df/dfa/vector_8c.html":[16,0,3,10],
"df/dfa/vector_8c.html#a15f534ebe962fda31cc191852befc250":[16,0,3,10,4],
"df/dfa/vector_8c.html#a1afee8aaf33d741df31a73048cff4473":[16,0,3,10,1],
@ -176,78 +183,71 @@ var NAVTREEINDEX3 =
"df/dfa/vector_8c.html#abdb067a98f90bcd9b0aa4ceb364d607f":[16,0,3,10,9],
"df/dfa/vector_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,3,10,7],
"df/dfa/vector_8c.html#af2f92e8cc55e764980bc0573ab5cd06f":[16,0,3,10,8],
"dir_03902f230b9e9b7c999f936617a23997.html":[16,0,11],
"dir_03902f230b9e9b7c999f936617a23997.html":[16,0,12],
"dir_0472225043064b54f3dfff9011a9fae0.html":[16,0,3,9,0],
"dir_079e1f799fb08a8a0b98cb030ab15687.html":[16,0,17,13],
"dir_0bc3e2a5baf077fa21dadc079776fcac.html":[16,0,17,7],
"dir_167af11096b7752ff31b3d4bec489317.html":[16,0,17,19],
"dir_16b947d8e9a05fe119d0675493324331.html":[16,0,17,1],
"dir_16e00c78ef36d1842d0d8a4afc46b852.html":[16,0,17,14],
"dir_1833eb69ceee7a265ffba4c38c8243d2.html":[16,0,17,16],
"dir_18cba55772148686552805a354a79093.html":[16,0,17,6],
"dir_079e1f799fb08a8a0b98cb030ab15687.html":[16,0,18,13],
"dir_0bc3e2a5baf077fa21dadc079776fcac.html":[16,0,18,7],
"dir_167af11096b7752ff31b3d4bec489317.html":[16,0,18,19],
"dir_16b947d8e9a05fe119d0675493324331.html":[16,0,18,1],
"dir_16e00c78ef36d1842d0d8a4afc46b852.html":[16,0,18,14],
"dir_1833eb69ceee7a265ffba4c38c8243d2.html":[16,0,18,16],
"dir_18cba55772148686552805a354a79093.html":[16,0,18,6],
"dir_2176ba3565d8b1fe2a106d18679cc7bf.html":[16,0,3,9],
"dir_261dd1200fad5b2fe1eca9af8320656e.html":[16,0,3,6],
"dir_296d53ceaeaa7e099814a6def439fe8a.html":[16,0,13],
"dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html":[16,0,17,11],
"dir_2b14f32f14b51065d3a322bea21da3c0.html":[16,0,17,5],
"dir_296d53ceaeaa7e099814a6def439fe8a.html":[16,0,14],
"dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html":[16,0,18,11],
"dir_2b14f32f14b51065d3a322bea21da3c0.html":[16,0,18,5],
"dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html":[16,0,3],
"dir_2f070f19f76dfadabbc24fe483d7e98d.html":[16,0,17,17],
"dir_2f070f19f76dfadabbc24fe483d7e98d.html":[16,0,18,17],
"dir_2fede762f95c9c526850a639b984c56b.html":[16,0,3,4],
"dir_3343723ae086de42ee4ca9774da3a13f.html":[16,0,12],
"dir_4500de955d1eddb82f69331d96e39ed9.html":[16,0,5,1],
"dir_475f56e0a4ef6254f5610544d8d68aa3.html":[16,0,5,4],
"dir_48bf5503321d91c557399989fed5dabd.html":[16,0,5],
"dir_4991c92e00761dd3d764efa2906b4318.html":[16,0,17,9],
"dir_4a15c8553efb9e59e3f1091cc0d3a27d.html":[16,0,17,21],
"dir_4b6f782e158b0b98da980a0e11a23a15.html":[16,0,6],
"dir_4bae997a2671812c2140d5abfb6305a4.html":[16,0,17,20],
"dir_607f15d36c772334f988bb9ef82d102c.html":[16,0,17,18],
"dir_614f310c248f2b9541b559085cafcb40.html":[16,0,11,0],
"dir_63185e90e67935ef3eb5903a044c89e2.html":[16,0,16],
"dir_72aaf47615111200018c039a56ef48be.html":[16,0,10],
"dir_3343723ae086de42ee4ca9774da3a13f.html":[16,0,13],
"dir_4500de955d1eddb82f69331d96e39ed9.html":[16,0,6,1],
"dir_475f56e0a4ef6254f5610544d8d68aa3.html":[16,0,6,4],
"dir_48bf5503321d91c557399989fed5dabd.html":[16,0,6],
"dir_4991c92e00761dd3d764efa2906b4318.html":[16,0,18,9],
"dir_4a15c8553efb9e59e3f1091cc0d3a27d.html":[16,0,18,21],
"dir_4b6f782e158b0b98da980a0e11a23a15.html":[16,0,7],
"dir_4bae997a2671812c2140d5abfb6305a4.html":[16,0,18,20],
"dir_607f15d36c772334f988bb9ef82d102c.html":[16,0,18,18],
"dir_614f310c248f2b9541b559085cafcb40.html":[16,0,12,0],
"dir_63185e90e67935ef3eb5903a044c89e2.html":[16,0,17],
"dir_72aaf47615111200018c039a56ef48be.html":[16,0,11],
"dir_7445e5a68245b48f3c03982b6d501815.html":[16,0,3,2],
"dir_76784a7b04633629b9ecb5543b9ad889.html":[16,0,5,2],
"dir_81f43aa0067826ea5befe80cd7aefcc5.html":[16,0,5,3],
"dir_8c6743d405e8ed13cc39f42e382307fd.html":[16,0,17,0],
"dir_76784a7b04633629b9ecb5543b9ad889.html":[16,0,6,2],
"dir_81f43aa0067826ea5befe80cd7aefcc5.html":[16,0,6,3],
"dir_8a20dd5bfd5341a725342bf72b6b686f.html":[16,0,5],
"dir_8c6743d405e8ed13cc39f42e382307fd.html":[16,0,18,0],
"dir_955029374964e51cf770754b424e7d39.html":[16,0,3,5],
"dir_9babc524d57e25f3d9f4179cabc3599e.html":[16,0,2],
"dir_9c6faab82c22511b50177aa2e38e2780.html":[16,0,15],
"dir_a4300992e825aa9b9238bf43160a241e.html":[16,0,9],
"dir_a52f4d3d586a58b02f3a4ddf0a992157.html":[16,0,14],
"dir_9c6faab82c22511b50177aa2e38e2780.html":[16,0,16],
"dir_a4300992e825aa9b9238bf43160a241e.html":[16,0,10],
"dir_a52f4d3d586a58b02f3a4ddf0a992157.html":[16,0,15],
"dir_a5f32cf82ad289a7dac212f63f40f55b.html":[16,0,0],
"dir_aba97bf327db94061e830e9bc18e925d.html":[16,0,17,4],
"dir_aba97bf327db94061e830e9bc18e925d.html":[16,0,18,4],
"dir_abf1a26ece768c4076e73592705ae077.html":[16,0,4],
"dir_b2dbfa46230fd9f775c32c1836ed3764.html":[16,0,17,15],
"dir_b3d331eabd4234f247030c297aaf021c.html":[16,0,17],
"dir_b2dbfa46230fd9f775c32c1836ed3764.html":[16,0,18,15],
"dir_b3d331eabd4234f247030c297aaf021c.html":[16,0,18],
"dir_b6018f60d424a2ef7e4c942ac681e38b.html":[16,0,3,7],
"dir_bb1b521853a9c46347182a9d10420771.html":[16,0,19],
"dir_bb1b521853a9c46347182a9d10420771.html":[16,0,20],
"dir_bd4a7dd282074645ef41b1ea31ac813a.html":[16,0,3,3],
"dir_c7ef0fcb2f2095a74f0a3a1634dfc798.html":[16,0,3,0],
"dir_d20ad0b8de644c123692ba5582cc7a7b.html":[16,0,1],
"dir_d4c35186c199e728d69dee6bf5b2473c.html":[16,0,17,22],
"dir_d9112ab06cf4d4e5a25d385a268d1949.html":[16,0,17,2],
"dir_d9e100c82ada2163abea49688a71e81c.html":[16,0,17,10],
"dir_da574daf9ce9c05b45556bdc871ed1e3.html":[16,0,18],
"dir_e3380d2178455503f266746fb14246a5.html":[16,0,7],
"dir_d4c35186c199e728d69dee6bf5b2473c.html":[16,0,18,22],
"dir_d9112ab06cf4d4e5a25d385a268d1949.html":[16,0,18,2],
"dir_d9e100c82ada2163abea49688a71e81c.html":[16,0,18,10],
"dir_da574daf9ce9c05b45556bdc871ed1e3.html":[16,0,19],
"dir_e3380d2178455503f266746fb14246a5.html":[16,0,8],
"dir_e39df94f82619fa5256f1786519937be.html":[16,0,3,1],
"dir_e79632891301b850df87e9c0030293fa.html":[16,0,8],
"dir_eeeea13e3a5e5edad3499183767ce312.html":[16,0,17,8],
"dir_f75ccd45e00436eafed446b9b2682984.html":[16,0,17,12],
"dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html":[16,0,17,3],
"dir_e79632891301b850df87e9c0030293fa.html":[16,0,9],
"dir_eeeea13e3a5e5edad3499183767ce312.html":[16,0,18,8],
"dir_f75ccd45e00436eafed446b9b2682984.html":[16,0,18,12],
"dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html":[16,0,18,3],
"dir_fb09f588f9daea69f78b63a0310e98cc.html":[16,0,3,8],
"dir_fe5d69ed7d90cb356556070c2a2e5478.html":[16,0,5,0],
"dir_fe5d69ed7d90cb356556070c2a2e5478.html":[16,0,6,0],
"files.html":[16,0],
"functions.html":[15,2,0],
"functions_vars.html":[15,2,1],
"globals.html":[16,1,0],
"globals.html":[16,1,0,0],
"globals_a.html":[16,1,0,1],
"globals_b.html":[16,1,0,2],
"globals_c.html":[16,1,0,3],
"globals_d.html":[16,1,0,4],
"globals_defs.html":[16,1,4],
"globals_e.html":[16,1,0,5],
"globals_f.html":[16,1,0,6],
"globals_func.html":[16,1,1,0],
"globals_func.html":[16,1,1]
"globals.html":[16,1,0],
"globals_a.html":[16,1,0,1]
};

View File

@ -1,5 +1,13 @@
var NAVTREEINDEX4 =
{
"globals_b.html":[16,1,0,2],
"globals_c.html":[16,1,0,3],
"globals_d.html":[16,1,0,4],
"globals_defs.html":[16,1,4],
"globals_e.html":[16,1,0,5],
"globals_f.html":[16,1,0,6],
"globals_func.html":[16,1,1,0],
"globals_func.html":[16,1,1],
"globals_func_a.html":[16,1,1,1],
"globals_func_b.html":[16,1,1,2],
"globals_func_c.html":[16,1,1,3],
@ -46,10 +54,10 @@ var NAVTREEINDEX4 =
"globals_x.html":[16,1,0,24],
"index.html":[],
"index.html":[0],
"index.html#autotoc_md76":[0,0],
"index.html#autotoc_md77":[0,1],
"index.html#autotoc_md78":[0,2],
"index.html#autotoc_md79":[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":[]
};

View File

@ -7,7 +7,7 @@ var searchData=
['tcp_5fhalf_5fduplex_5fclient_2ec_4',['tcp_half_duplex_client.c',['../da/d07/tcp__half__duplex__client_8c.html',1,'']]],
['tcp_5fhalf_5fduplex_5fserver_2ec_5',['tcp_half_duplex_server.c',['../d6/d2b/tcp__half__duplex__server_8c.html',1,'']]],
['term_6',['term',['../df/d86/structterm.html',1,'']]],
['test_7',['test',['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c'],['../d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;odd_even_sort.c'],['../de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort_recursive.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5',1,'test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t len):&#160;alaw.c'],['../d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;celsius_to_fahrenheit.c'],['../d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_any_base.c'],['../d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_binary_recursion.c'],['../da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;infix_to_postfix2.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;octal_to_hexadecimal.c'],['../dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;roman_numerals_to_decimal.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;words_alphabetical.c'],['../df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c',1,'test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V):&#160;prim.c'],['../d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;6.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_formula.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prime_sieve.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;postfix_evaluation.c'],['../de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rot13.c'],['../d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;run_length_encoding.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;non_preemptive_priority_scheduling.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_search.c'],['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algorithm.c'],['../de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;heap_sort_2.c'],['../d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sentinel_linear_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort_2.c']]],
['test_7',['test',['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c'],['../d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;odd_even_sort.c'],['../de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort_recursive.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5',1,'test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t len):&#160;alaw.c'],['../d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;celsius_to_fahrenheit.c'],['../d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_any_base.c'],['../d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_binary_recursion.c'],['../da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;infix_to_postfix2.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;octal_to_hexadecimal.c'],['../dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;roman_numerals_to_decimal.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;words_alphabetical.c'],['../df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector.c'],['../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcs.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c',1,'test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V):&#160;prim.c'],['../d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;6.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_formula.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prime_sieve.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;postfix_evaluation.c'],['../de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rot13.c'],['../d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;run_length_encoding.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;non_preemptive_priority_scheduling.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_search.c'],['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algorithm.c'],['../de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;heap_sort_2.c'],['../d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sentinel_linear_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort_2.c']]],
['test1_8',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af',1,'test1(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_9',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.c'],['../d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;k_means_clustering.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409',1,'test2(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_10',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57',1,'test3(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c']]],

View File

@ -27,7 +27,7 @@ var searchData=
['isempty_24',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_25',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_26',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_27',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_28',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_27',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_28',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isstrong_29',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

View File

@ -5,19 +5,22 @@ var searchData=
['large_5fnum_2',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]],
['lazy_5fsort_3',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_4',['lcm',['../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol3.c']]],
['leetcode_5',['LeetCode',['../d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html',1,'']]],
['left_6',['left',['../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0',1,'node::left()'],['../db/d8b/struct_node.html#ad0976834843c7618677d22a10c495b36',1,'Node::left()']]],
['len_7',['len',['../d4/d06/struct_vector.html#a55870593ddea19c96770c2521b075059',1,'Vector']]],
['len_8',['LEN',['../df/d27/alaw_8c.html#a05b49c662c073f89e86804f7856622a0',1,'alaw.c']]],
['len_9',['len',['../df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93',1,'vector.c']]],
['length_10',['length',['../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e',1,'segment_tree']]],
['library_20for_203d_20vectors_20_26_20quaternions_11',['Library for 3D Vectors &amp; Quaternions',['../de/d5a/group__quaternions.html',1,'']]],
['lims_12',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]],
['line_13',['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_14',['list',['../d8/d10/structlist.html',1,'']]],
['list_15',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]],
['listitem_16',['ListItem',['../d1/d7d/struct_list_item.html',1,'']]],
['llink_17',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_18',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_19',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
['lcs_2ec_5',['lcs.c',['../db/de1/lcs_8c.html',1,'']]],
['lcsbuild_6',['lcsbuild',['../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0',1,'lcs.c']]],
['lcslen_7',['lcslen',['../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6',1,'lcs.c']]],
['leetcode_8',['LeetCode',['../d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html',1,'']]],
['left_9',['left',['../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0',1,'node::left()'],['../db/d8b/struct_node.html#ad0976834843c7618677d22a10c495b36',1,'Node::left()']]],
['len_10',['len',['../d4/d06/struct_vector.html#a55870593ddea19c96770c2521b075059',1,'Vector']]],
['len_11',['LEN',['../df/d27/alaw_8c.html#a05b49c662c073f89e86804f7856622a0',1,'alaw.c']]],
['len_12',['len',['../df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93',1,'vector.c']]],
['length_13',['length',['../dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e',1,'segment_tree']]],
['library_20for_203d_20vectors_20_26_20quaternions_14',['Library for 3D Vectors &amp; Quaternions',['../de/d5a/group__quaternions.html',1,'']]],
['lims_15',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]],
['line_16',['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_17',['list',['../d8/d10/structlist.html',1,'']]],
['list_18',['List',['../dd/d29/doubly__linked__list_8c.html#aa89b8bc105d9a09d4e7c06e8b34078a7',1,'doubly_linked_list.c']]],
['listitem_19',['ListItem',['../d1/d7d/struct_list_item.html',1,'']]],
['llink_20',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_21',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_22',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
];

File diff suppressed because one or more lines are too long

View File

@ -1,4 +1,5 @@
var searchData=
[
['lu_5fdecompose_2ec_0',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
['lcs_2ec_0',['lcs.c',['../db/de1/lcs_8c.html',1,'']]],
['lu_5fdecompose_2ec_1',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
];

View File

@ -1,6 +1,6 @@
var searchData=
[
['test_0',['test',['../df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5',1,'test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t len):&#160;alaw.c'],['../d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;celsius_to_fahrenheit.c'],['../d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_any_base.c'],['../d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_binary_recursion.c'],['../da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;infix_to_postfix2.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;octal_to_hexadecimal.c'],['../dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;roman_numerals_to_decimal.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;words_alphabetical.c'],['../df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c',1,'test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V):&#160;prim.c'],['../d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;6.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_formula.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prime_sieve.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;postfix_evaluation.c'],['../de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rot13.c'],['../d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;run_length_encoding.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;non_preemptive_priority_scheduling.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_search.c'],['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algorithm.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sentinel_linear_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort_2.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;heap_sort_2.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort_recursive.c'],['../d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;odd_even_sort.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c'],['../dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.c']]],
['test_0',['test',['../df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5',1,'test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t len):&#160;alaw.c'],['../d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;celsius_to_fahrenheit.c'],['../d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_any_base.c'],['../d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_binary_recursion.c'],['../da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;infix_to_postfix2.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;octal_to_hexadecimal.c'],['../dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;roman_numerals_to_decimal.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;words_alphabetical.c'],['../df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector.c'],['../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcs.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c',1,'test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V):&#160;prim.c'],['../d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;6.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_formula.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prime_sieve.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;postfix_evaluation.c'],['../de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rot13.c'],['../d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;run_length_encoding.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;non_preemptive_priority_scheduling.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_search.c'],['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algorithm.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sentinel_linear_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort_2.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;heap_sort_2.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort_recursive.c'],['../d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;odd_even_sort.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c'],['../dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.c']]],
['test1_1',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af',1,'test1(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_2',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.c'],['../d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;k_means_clustering.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409',1,'test2(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_3',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57',1,'test3(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c']]],

View File

@ -19,7 +19,7 @@ var searchData=
['isempty_16',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_17',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_18',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_19',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_20',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_19',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_20',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

View File

@ -3,6 +3,8 @@ var searchData=
['l_5flength_0',['l_length',['../d2/d87/non__preemptive__priority__scheduling_8c.html#a40e454ce0750e794007bf41a7102b3a9',1,'non_preemptive_priority_scheduling.c']]],
['lazy_5fsort_1',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_2',['lcm',['../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol3.c']]],
['len_3',['len',['../df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93',1,'vector.c']]],
['lu_5fdecomposition_4',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
['lcsbuild_3',['lcsbuild',['../db/de1/lcs_8c.html#a741c9173a9fef243518f5c2352b81fc0',1,'lcs.c']]],
['lcslen_4',['lcslen',['../db/de1/lcs_8c.html#ac107a0b0233dacb9e8cd3a983d6740b6',1,'lcs.c']]],
['len_5',['len',['../df/dfa/vector_8c.html#a6f8a49f17bf315bdc30749a57bc7bc93',1,'vector.c']]],
['lu_5fdecomposition_6',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
];

File diff suppressed because one or more lines are too long