OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

Documentation for b693440d55

Browse Source
This commit is contained in:
github-actions 2020-07-04 18:01:07 +00:00
parent 52c56cb29f
commit d0bd30e123
109 changed files with 765 additions and 457 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

141
d2/da8/bead__sort_8c.html
View File

@ -111,19 +111,19 @@ Include dependency graph for bead_sort.c:</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memItemLeft" align="right" valign="top"><a id="a4fdb8af29a07ac8f496e49a11bf9f1bd"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j)&#160;&#160;&#160;beads[i * <a class="el" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> + j]</td></tr>
<tr class="memdesc:a4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create easy access of elements from a 2D matrix stored in memory as a 1D array. <br /></td></tr>
<tr class="separator:a4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memItemLeft" align="right" valign="top">
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j)&#160;&#160;&#160;beads[i * <a class="el" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> + j]</td></tr>
<tr class="memdesc:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create easy access of elements from a 2D matrix stored in memory as a 1D array. <br /></td></tr>
<tr class="separator:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ad7ed8cc4603f500d610054680d28b971"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">display</a> (const int *arr, int n)</td></tr>
<tr class="memdesc:ad7ed8cc4603f500d610054680d28b971"><td class="mdescLeft">&#160;</td><td class="mdescRight">Displays the array, passed to this method. <a href="../../d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">More...</a><br /></td></tr>
<tr class="separator:ad7ed8cc4603f500d610054680d28b971"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2fb01e00dedb437a42010f6309e7eba8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8">bead_sort</a> (int *a, size_t len)</td></tr>
<tr class="memdesc:a2fb01e00dedb437a42010f6309e7eba8"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is where the sorting of the array takes place. <a href="../../d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8">More...</a><br /></td></tr>
<tr class="separator:a2fb01e00dedb437a42010f6309e7eba8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gad7ed8cc4603f500d610054680d28b971"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">display</a> (const int *arr, int n)</td></tr>
<tr class="memdesc:gad7ed8cc4603f500d610054680d28b971"><td class="mdescLeft">&#160;</td><td class="mdescRight">Displays the array, passed to this method. <a href="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">More...</a><br /></td></tr>
<tr class="separator:gad7ed8cc4603f500d610054680d28b971"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga2fb01e00dedb437a42010f6309e7eba8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort</a> (int *a, size_t len)</td></tr>
<tr class="memdesc:ga2fb01e00dedb437a42010f6309e7eba8"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is where the sorting of the array takes place. <a href="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">More...</a><br /></td></tr>
<tr class="separator:ga2fb01e00dedb437a42010f6309e7eba8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0f2228420376f4db7e1274f2b41667c"><td class="memItemLeft" align="right" valign="top"><a id="ac0f2228420376f4db7e1274f2b41667c"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">main</a> (int argc, const char *argv[])</td></tr>
<tr class="memdesc:ac0f2228420376f4db7e1274f2b41667c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
@ -131,127 +131,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../..
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort">bead sort</a> </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a2fb01e00dedb437a42010f6309e7eba8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2fb01e00dedb437a42010f6309e7eba8">&#9670;&nbsp;</a></span>bead_sort()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void bead_sort </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>len</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This is where the sorting of the array takes place. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">a</td><td>array to be sorted </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">len</td><td>Array Size </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160;{</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <span class="keywordtype">int</span> i, j, <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>, sum;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *beads;</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordflow">for</span> (i = 1, <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = a[0]; i &lt; len; i++)</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keywordflow">if</span> (a[i] &gt; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>)</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = a[i];</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; beads = calloc(1, <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> * len);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; </div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="comment">/* mark the beads */</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keywordflow">for</span> (i = 0; i &lt; len; i++)</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordflow">for</span> (j = 0; j &lt; a[i]; j++) <a class="code" href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 1;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keywordflow">for</span> (j = 0; j &lt; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>; j++)</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="comment">/* count how many beads are on each post */</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <span class="keywordflow">for</span> (sum = i = 0; i &lt; len; i++)</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; {</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; sum += <a class="code" href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j);</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <a class="code" href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 0;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; }</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="comment">/* mark bottom sum beads */</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">for</span> (i = len - sum; i &lt; len; i++) <a class="code" href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 1;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordflow">for</span> (i = 0; i &lt; len; i++)</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">for</span> (j = 0; j &lt; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> &amp;&amp; <a class="code" href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j); j++)</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; ;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; a[i] = j;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; }</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; free(beads);</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ad7ed8cc4603f500d610054680d28b971"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad7ed8cc4603f500d610054680d28b971">&#9670;&nbsp;</a></span>display()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void display </td>
<td>(</td>
<td class="paramtype">const int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>n</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Displays the array, passed to this method. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">arr</td><td>array to display </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>number of elements in the array </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;{</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; {</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; printf(<span class="stringliteral">&quot;%d &quot;</span>, arr[i]);</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; }</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; </div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; printf(<span class="stringliteral">&quot;\n&quot;</span>);</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="abead__sort_8c_html_a4fdb8af29a07ac8f496e49a11bf9f1bd"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><div class="ttdeci">#define BEAD(i, j)</div><div class="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:12</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>

6
d2/da8/bead__sort_8c.js
View File

@ -1,7 +1,7 @@
var bead__sort_8c =
[
[ "BEAD", "d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd", null ],
[ "bead_sort", "d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8", null ],
[ "display", "d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971", null ],
[ "BEAD", "d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd", null ],
[ "bead_sort", "d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8", null ],
[ "display", "d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971", null ],
[ "main", "d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c", null ]
];

2
d2/dc3/carray_8h_source.html
View File

@ -181,13 +181,13 @@ $(document).ready(function(){initNavTree('d2/dc3/carray_8h_source.html','../../'
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;<span class="preprocessor">#endif</span></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="agroup__sorting_html_ga4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:26</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gac6afabdc09a49a433ee19d8a9486056d"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d">min</a></div><div class="ttdeci">#define min(a, b)</div><div class="ttdoc">shorthand for minimum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:43</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">the main function take one argument of type char* example : .</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:72</div></div>
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_ad19049ebfc2088bc1e75e7e958f7b60f"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f">c_atoi</a></div><div class="ttdeci">int c_atoi(const char *str)</div><div class="ttdoc">the function take a string and return an integer</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:16</div></div>
<div class="ttc" id="astruct_c_array_html"><div class="ttname"><a href="../../d4/d2d/struct_c_array.html">CArray</a></div><div class="ttdef"><b>Definition:</b> carray.h:32</div></div>
<div class="ttc" id="anewton__raphson__root_8c_html_a72f87d423a488946b319627a454d3925"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925">func</a></div><div class="ttdeci">double complex func(double complex x)</div><div class="ttdoc">Return value of the function to find the root for.</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:22</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:19</div></div>
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_a8c66c03637e48e375b80b5d7791e57be"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be">test_c_atoi</a></div><div class="ttdeci">void test_c_atoi()</div><div class="ttdoc">test the function implementation</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:56</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

2
d4/d68/qr__decompose_8h_source.html
View File

@ -300,6 +300,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="acollatz_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> collatz.c:16</div></div>
<div class="ttc" id="astruct__large__num_html"><div class="ttname"><a href="../../d3/d5a/struct__large__num.html">_large_num</a></div><div class="ttdoc">dynamically large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:15</div></div>
<div class="ttc" id="akohonen__som__trace_8c_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and t...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:358</div></div>
<div class="ttc" id="agroup__sorting_html_ga4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:26</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 class="ttc" id="astructadaline_html_a32e58c03fd9258709eae6138ad0ec657"><div class="ttname"><a href="../../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657">adaline::weights</a></div><div class="ttdeci">double * weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:46</div></div>
<div class="ttc" id="aode__forward__euler_8c_html_ae6c9413953c8d9d4bc9e374b29586350"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350">forward_euler_step</a></div><div class="ttdeci">void forward_euler_step(const double dx, const double *x, double *y, double *dy)</div><div class="ttdoc">Compute next step approximation using the forward-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:82</div></div>
@ -405,7 +406,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="agroup__kohonen__2d_html_ga83abb572c60d202e100595a989dfe123"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123">kohonen_update_weights</a></div><div class="ttdeci">double kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R)</div><div class="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:234</div></div>
<div class="ttc" id="anewton__raphson__root_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">solution accuracy</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:16</div></div>
<div class="ttc" id="akohonen__som__trace_8c_html_a41ae16442e3e5b891a58d2e5932a2cd0"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:410</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:19</div></div>
<div class="ttc" id="agroup__adaline_html_gac70b578aee679005fd336073969c3d94"><div class="ttname"><a href="../../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94">adaline_predict</a></div><div class="ttdeci">int adaline_predict(struct adaline *ada, const double *x, double *out)</div><div class="ttdoc">predict the output of the model for given set of features</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:136</div></div>
<div class="ttc" id="astructadaline_html"><div class="ttname"><a href="../../d2/daa/structadaline.html">adaline</a></div><div class="ttdoc">structure to hold adaline model parameters</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:44</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a></div><div class="ttdeci">int save_u_matrix(const char *fname, struct kohonen_array_3d *W)</div><div class="ttdoc">Create the distance matrix or U-matrix from the trained weights and save to disk.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:139</div></div>

370
d5/d4c/group__sorting.html Normal file
View File

@ -0,0 +1,370 @@
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: Sorting algorithms</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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C
&#160;<span id="projectnumber">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.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d5/d4c/group__sorting.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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#define-members">Macros</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">Sorting algorithms</div> </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memItemLeft" align="right" valign="top"><a id="ga4fdb8af29a07ac8f496e49a11bf9f1bd"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j)&#160;&#160;&#160;beads[i * <a class="el" href="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> + j]</td></tr>
<tr class="memdesc:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create easy access of elements from a 2D matrix stored in memory as a 1D array. <br /></td></tr>
<tr class="separator:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:gad7ed8cc4603f500d610054680d28b971"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">display</a> (const int *arr, int n)</td></tr>
<tr class="memdesc:gad7ed8cc4603f500d610054680d28b971"><td class="mdescLeft">&#160;</td><td class="mdescRight">Displays the array, passed to this method. <a href="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">More...</a><br /></td></tr>
<tr class="separator:gad7ed8cc4603f500d610054680d28b971"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga2fb01e00dedb437a42010f6309e7eba8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort</a> (int *a, size_t len)</td></tr>
<tr class="memdesc:ga2fb01e00dedb437a42010f6309e7eba8"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is where the sorting of the array takes place. <a href="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">More...</a><br /></td></tr>
<tr class="separator:ga2fb01e00dedb437a42010f6309e7eba8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gaeccaf61ff47279384d1dba8d869d5c2f"><td class="memItemLeft" align="right" valign="top"><a id="gaeccaf61ff47279384d1dba8d869d5c2f"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">show_data</a> (int *arr, long len)</td></tr>
<tr class="memdesc:gaeccaf61ff47279384d1dba8d869d5c2f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper function to print array values. <br /></td></tr>
<tr class="separator:gaeccaf61ff47279384d1dba8d869d5c2f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga4b9708d87be7a409eff20e5e7e8b43c8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a> (int *a, int *b)</td></tr>
<tr class="memdesc:ga4b9708d87be7a409eff20e5e7e8b43c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to swap values of two integers. <a href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">More...</a><br /></td></tr>
<tr class="separator:ga4b9708d87be7a409eff20e5e7e8b43c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga5bc16eaf3ffe6a6ab66780dd445904c0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a> (int *array, long LEN)</td></tr>
<tr class="memdesc:ga5bc16eaf3ffe6a6ab66780dd445904c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shell sort algorithm. <a href="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">More...</a><br /></td></tr>
<tr class="separator:ga5bc16eaf3ffe6a6ab66780dd445904c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<h2 class="groupheader">Function Documentation</h2>
<a id="ga2fb01e00dedb437a42010f6309e7eba8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga2fb01e00dedb437a42010f6309e7eba8">&#9670;&nbsp;</a></span>bead_sort()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void bead_sort </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>len</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This is where the sorting of the array takes place. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">a</td><td>array to be sorted </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">len</td><td>Array Size </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;{</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; <span class="keywordtype">int</span> i, j, <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>, sum;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *beads;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordflow">for</span> (i = 1, <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = a[0]; i &lt; len; i++)</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <span class="keywordflow">if</span> (a[i] &gt; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>)</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = a[i];</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; beads = calloc(1, <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> * len);</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="comment">/* mark the beads */</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordflow">for</span> (i = 0; i &lt; len; i++)</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">for</span> (j = 0; j &lt; a[i]; j++) <a class="code" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 1;</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordflow">for</span> (j = 0; j &lt; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>; j++)</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="comment">/* count how many beads are on each post */</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordflow">for</span> (sum = i = 0; i &lt; len; i++)</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; sum += <a class="code" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j);</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <a class="code" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 0;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; }</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">/* mark bottom sum beads */</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordflow">for</span> (i = len - sum; i &lt; len; i++) <a class="code" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 1;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; }</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">for</span> (i = 0; i &lt; len; i++)</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; {</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordflow">for</span> (j = 0; j &lt; <a class="code" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> &amp;&amp; <a class="code" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j); j++)</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; ;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; a[i] = j;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; }</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; free(beads);</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="gad7ed8cc4603f500d610054680d28b971"></a>
<h2 class="memtitle"><span class="permalink"><a href="#gad7ed8cc4603f500d610054680d28b971">&#9670;&nbsp;</a></span>display()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void display </td>
<td>(</td>
<td class="paramtype">const int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>n</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Displays the array, passed to this method. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">arr</td><td>array to display </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>number of elements in the array </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;{</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++)</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; {</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; printf(<span class="stringliteral">&quot;%d &quot;</span>, arr[i]);</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; }</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; </div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; printf(<span class="stringliteral">&quot;\n&quot;</span>);</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ga5bc16eaf3ffe6a6ab66780dd445904c0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga5bc16eaf3ffe6a6ab66780dd445904c0">&#9670;&nbsp;</a></span>shell_sort()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void shell_sort </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>array</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">long&#160;</td>
<td class="paramname"><em>LEN</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Shell sort algorithm. </p>
<p><br />
Optimized algorithm - takes half the time as other </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">array</td><td>array to sort </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">LEN</td><td>length of the array </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160;{</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> gap_len = 8;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keywordtype">long</span> i, j, g;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; </div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keywordflow">for</span> (g = 0; g &lt; gap_len; g++)</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; { <span class="comment">// for each gap</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordtype">int</span> gap = gaps[g];</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">for</span> (i = gap; i &lt; LEN; i++)</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; { <span class="comment">// from gap position to the end</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordtype">int</span> tmp = array[i];</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; </div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">for</span> (j = i; j &gt;= gap &amp;&amp; (array[j - gap] - tmp) &gt; 0; j -= gap)</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; array[j] = array[j - gap];</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; array[j] = tmp;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;<span class="preprocessor">#ifdef DEBUG</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordflow">for</span> (i = 0; i &lt; LEN; i++) printf(<span class="stringliteral">&quot;%s\t&quot;</span>, <a class="code" href="../../df/dea/structdata.html">data</a>[i]);</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ga4b9708d87be7a409eff20e5e7e8b43c8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga4b9708d87be7a409eff20e5e7e8b43c8">&#9670;&nbsp;</a></span>swap()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void swap </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>a</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>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to swap values of two integers. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">a</td><td>reference to first variable </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">b</td><td>reference to second variable </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;{</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <span class="keywordtype">int</span> tmp;</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; </div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; tmp = *a;</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; *a = *b;</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; *b = tmp;</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="agroup__sorting_html_ga4fdb8af29a07ac8f496e49a11bf9f1bd"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><div class="ttdeci">#define BEAD(i, j)</div><div class="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:16</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>
</div>
</body>
</html>

9
d5/d4c/group__sorting.js Normal file
View File

@ -0,0 +1,9 @@
var group__sorting =
[
[ "BEAD", "d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd", null ],
[ "bead_sort", "d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8", null ],
[ "display", "d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971", null ],
[ "shell_sort", "d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0", null ],
[ "show_data", "d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f", null ],
[ "swap", "d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8", null ]
];

22
d6/ded/shell__sort2_8c.html
View File

@ -111,18 +111,16 @@ Include dependency graph for shell_sort2.c:</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aeccaf61ff47279384d1dba8d869d5c2f"><td class="memItemLeft" align="right" valign="top"><a id="aeccaf61ff47279384d1dba8d869d5c2f"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f">show_data</a> (int *arr, long len)</td></tr>
<tr class="memdesc:aeccaf61ff47279384d1dba8d869d5c2f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper function to print array values. <br /></td></tr>
<tr class="separator:aeccaf61ff47279384d1dba8d869d5c2f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4b9708d87be7a409eff20e5e7e8b43c8"><td class="memItemLeft" align="right" valign="top"><a id="a4b9708d87be7a409eff20e5e7e8b43c8"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">swap</a> (int *a, int *b)</td></tr>
<tr class="memdesc:a4b9708d87be7a409eff20e5e7e8b43c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to swap values of two integers. <br /></td></tr>
<tr class="separator:a4b9708d87be7a409eff20e5e7e8b43c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5bc16eaf3ffe6a6ab66780dd445904c0"><td class="memItemLeft" align="right" valign="top"><a id="a5bc16eaf3ffe6a6ab66780dd445904c0"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a> (int *array, long LEN)</td></tr>
<tr class="memdesc:a5bc16eaf3ffe6a6ab66780dd445904c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Optimized algorithm - takes half the time as other. <br /></td></tr>
<tr class="separator:a5bc16eaf3ffe6a6ab66780dd445904c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gaeccaf61ff47279384d1dba8d869d5c2f"><td class="memItemLeft" align="right" valign="top">
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">show_data</a> (int *arr, long len)</td></tr>
<tr class="memdesc:gaeccaf61ff47279384d1dba8d869d5c2f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper function to print array values. <br /></td></tr>
<tr class="separator:gaeccaf61ff47279384d1dba8d869d5c2f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga4b9708d87be7a409eff20e5e7e8b43c8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a> (int *a, int *b)</td></tr>
<tr class="memdesc:ga4b9708d87be7a409eff20e5e7e8b43c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to swap values of two integers. <a href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">More...</a><br /></td></tr>
<tr class="separator:ga4b9708d87be7a409eff20e5e7e8b43c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga5bc16eaf3ffe6a6ab66780dd445904c0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a> (int *array, long LEN)</td></tr>
<tr class="memdesc:ga5bc16eaf3ffe6a6ab66780dd445904c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shell sort algorithm. <a href="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">More...</a><br /></td></tr>
<tr class="separator:ga5bc16eaf3ffe6a6ab66780dd445904c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top"><a id="a0ddf1224851353fc92bfbff6f499fa97"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/ded/shell__sort2_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. <br /></td></tr>

6
d6/ded/shell__sort2_8c.js
View File

@ -1,7 +1,7 @@
var shell__sort2_8c =
[
[ "main", "d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
[ "shell_sort", "d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0", null ],
[ "show_data", "d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f", null ],
[ "swap", "d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8", null ]
[ "shell_sort", "d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0", null ],
[ "show_data", "d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f", null ],
[ "swap", "d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8", null ]
];

16
d7/dd8/c__atoi__str__to__integer_8c.html
View File

@ -241,6 +241,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><div class="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><div class="ttdoc">Find the next abundant number after N and not including N.</div><div class="ttdef"><b>Definition:</b> sol1.c:55</div></div>
<div class="ttc" id="aproblem__10_2sol1_8c_html_acc871ab6bfead702e983a7f9c412915f"><div class="ttname"><a href="../../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f">is_prime</a></div><div class="ttdeci">char is_prime(unsigned long n)</div><div class="ttdoc">Function to check if a number is prime.</div><div class="ttdef"><b>Definition:</b> sol1.c:11</div></div>
<div class="ttc" id="aproblem__1_2sol1_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol1.c:12</div></div>
<div class="ttc" id="agroup__sorting_html_ga4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:26</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 class="ttc" id="aproblem__4_2sol_8c_html_adf9bea8d35848959bde5b3f277edf0c4"><div class="ttname"><a href="../../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4">is_palindromic</a></div><div class="ttdeci">int is_palindromic(unsigned int n)</div><div class="ttdoc">Check if number is palindromic.</div><div class="ttdef"><b>Definition:</b> sol.c:12</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_aca7d5718ab8c38506adb3bef2469b319"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">MOD</a></div><div class="ttdeci">#define MOD</div><div class="ttdoc">modulo limit</div><div class="ttdef"><b>Definition:</b> sol1.c:17</div></div>
@ -261,6 +262,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_acd864640121c7df2c19f61f7baa507e4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4">N2</a></div><div class="ttdeci">#define N2</div><div class="ttdoc">number of digits in output number</div><div class="ttdef"><b>Definition:</b> sol1.c:111</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
<div class="ttc" id="aproblem__22_2sol1_8c_html_afd709f201d7643c3909621f620ea648a"><div class="ttname"><a href="../../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a">MAX_NAME_LEN</a></div><div class="ttdeci">#define MAX_NAME_LEN</div><div class="ttdoc">Maximum length of each name.</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="agroup__sorting_html_ga2fb01e00dedb437a42010f6309e7eba8"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort</a></div><div class="ttdeci">void bead_sort(int *a, size_t len)</div><div class="ttdoc">This is where the sorting of the array takes place.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:37</div></div>
<div class="ttc" id="arealtime__stats_8c_html_a63ddcdaab24f722f0963fa2fbe0ae628"><div class="ttname"><a href="../../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628">stats_computer1</a></div><div class="ttdeci">void stats_computer1(float x, float *mean, float *variance, float *std)</div><div class="ttdoc">continuous mean and variance computance using first value as an approximation for the mean.</div><div class="ttdef"><b>Definition:</b> realtime_stats.c:24</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">test function to compute eigen values of a 2x2 matrix</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:253</div></div>
<div class="ttc" id="aproblem__20_2sol1_8c_html_a54a02c4b963fdb16f24959e0137763f1"><div class="ttname"><a href="../../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1">remove_digits</a></div><div class="ttdeci">char remove_digits(big_int *digit, int N)</div><div class="ttdoc">Function to remove digits preceeding the current digit.</div><div class="ttdef"><b>Definition:</b> sol1.c:76</div></div>
@ -280,9 +282,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aproblem__10_2sol1_8c_html_ae3d987cb2ad0ddb0c3caa4c2506a20e5"><div class="ttname"><a href="../../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sum_of_primes</a></div><div class="ttdeci">unsigned long long sum_of_primes(unsigned long N)</div><div class="ttdoc">Computes sum of prime numbers less than N.</div><div class="ttdef"><b>Definition:</b> sol1.c:21</div></div>
<div class="ttc" id="aproblem__5_2sol_8c_html_ae9606f1867e9921867d6572f51377b4c"><div class="ttname"><a href="../../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a></div><div class="ttdeci">unsigned long lcm(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Least Common Multiple (LCM) of two numbers.</div><div class="ttdef"><b>Definition:</b> sol.c:31</div></div>
<div class="ttc" id="aqr__decompose_8h_html"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></div><div class="ttdoc">Library functions to compute QR decomposition of a given matrix.</div></div>
<div class="ttc" id="abead__sort_8c_html_a4fdb8af29a07ac8f496e49a11bf9f1bd"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><div class="ttdeci">#define BEAD(i, j)</div><div class="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:12</div></div>
<div class="ttc" id="astruct__big__int_html_a187538b984c86d7cfdb13e297e7f3564"><div class="ttname"><a href="../../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564">_big_int::next_digit</a></div><div class="ttdeci">struct _big_int * next_digit</div><div class="ttdoc">hundreds place</div><div class="ttdef"><b>Definition:</b> sol1.c:20</div></div>
<div class="ttc" id="ashell__sort2_8c_html_aeccaf61ff47279384d1dba8d869d5c2f"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f">show_data</a></div><div class="ttdeci">void show_data(int *arr, long len)</div><div class="ttdoc">Helper function to print array values.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:12</div></div>
<div class="ttc" id="aproblem__25_2sol1_8c_html_a2b90df6bfbf0d18cd9a19c1a71453783"><div class="ttname"><a href="../../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783">get_digits</a></div><div class="ttdeci">unsigned int get_digits(unsigned char *number)</div><div class="ttdoc">Get number of digits in a large number.</div><div class="ttdef"><b>Definition:</b> sol1.c:71</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a4f128410e6582fe26488e2316cc96e17"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a></div><div class="ttdeci">unsigned long is_abundant(unsigned long N)</div><div class="ttdoc">Is the given number an abundant number (1) or not (0)</div><div class="ttdef"><b>Definition:</b> sol1.c:47</div></div>
<div class="ttc" id="aqr__decompose_8h_html_a90562ce8c3707401e9c5809dece68d6a"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a></div><div class="ttdeci">void print_matrix(double **A, int M, int N)</div><div class="ttdoc">function to display matrix on stdout</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:22</div></div>
@ -298,6 +298,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aqr__eigen__values_8c_html_a741477692f001a805b0fea942c9dc2b9"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9">mat_mul</a></div><div class="ttdeci">double ** mat_mul(double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)</div><div class="ttdoc">Perform multiplication of two matrices.</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:59</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_aabf4f709c8199e41cf279c77112345fe"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a></div><div class="ttdeci">#define MAX_LEN</div><div class="ttdoc">length of resulting recurring fraction number</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><div class="ttdeci">struct Node node</div><div class="ttdoc">Node, the basic data structure of the tree.</div></div>
<div class="ttc" id="agroup__sorting_html_gad7ed8cc4603f500d610054680d28b971"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">display</a></div><div class="ttdeci">void display(const int *arr, int n)</div><div class="ttdoc">Displays the array, passed to this method.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:23</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a337e545af040d754dc012b42523ee1ee"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a></div><div class="ttdeci">unsigned long MAX_N</div><div class="ttdoc">upper limit of numbers to check</div><div class="ttdef"><b>Definition:</b> sol1.c:13</div></div>
<div class="ttc" id="aproblem__5_2sol_8c_html_a59347107cbfdf48d51108e50280e760d"><div class="ttname"><a href="../../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a></div><div class="ttdeci">unsigned long gcd(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.</div><div class="ttdef"><b>Definition:</b> sol.c:11</div></div>
<div class="ttc" id="abinary__search_8c_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> binary_search.c:105</div></div>
@ -315,23 +316,22 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aproblem__15_2sol1_8c_html_a4650d1d3897633d84253f93433f601d6"><div class="ttname"><a href="../../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6">number_of_paths</a></div><div class="ttdeci">unsigned long long number_of_paths(int N)</div><div class="ttdoc">At every node, there are 2 possible ways to move -&gt; down or right.</div><div class="ttdef"><b>Definition:</b> sol1.c:17</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><div class="ttdeci">char is_sum_of_abundant(unsigned long N)</div><div class="ttdoc">check if a given number can be represented as a sum of two abundant numbers.</div><div class="ttdef"><b>Definition:</b> sol2.c:85</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_ac260f58785fb20eb09bb35385a7d47f8"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a></div><div class="ttdeci">int get_number(FILE *fp, char *buffer, uint8_t *out_int)</div><div class="ttdoc">Function to read the number from a file and store it in array.</div><div class="ttdef"><b>Definition:</b> sol1.c:16</div></div>
<div class="ttc" id="abead__sort_8c_html_a2fb01e00dedb437a42010f6309e7eba8"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8">bead_sort</a></div><div class="ttdeci">void bead_sort(int *a, size_t len)</div><div class="ttdoc">This is where the sorting of the array takes place.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:33</div></div>
<div class="ttc" id="agroup__sorting_html_gaeccaf61ff47279384d1dba8d869d5c2f"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">show_data</a></div><div class="ttdeci">void show_data(int *arr, long len)</div><div class="ttdoc">Helper function to print array values.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:16</div></div>
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_ad19049ebfc2088bc1e75e7e958f7b60f"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f">c_atoi</a></div><div class="ttdeci">int c_atoi(const char *str)</div><div class="ttdoc">the function take a string and return an integer</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:16</div></div>
<div class="ttc" id="aproblem__14_2sol1_8c_html_a81c1df5c17cb16bcc16e346fcff6fa80"><div class="ttname"><a href="../../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80">collatz</a></div><div class="ttdeci">long long collatz(long long start_num)</div><div class="ttdoc">Computes the length of collatz sequence for a given starting number.</div><div class="ttdef"><b>Definition:</b> sol1.c:27</div></div>
<div class="ttc" id="abead__sort_8c_html_ac0f2228420376f4db7e1274f2b41667c"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">main</a></div><div class="ttdeci">int main(int argc, const char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:70</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:55</div></div>
<div class="ttc" id="abead__sort_8c_html_ac0f2228420376f4db7e1274f2b41667c"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">main</a></div><div class="ttdeci">int main(int argc, const char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:75</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:66</div></div>
<div class="ttc" id="abinary__search_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> binary_search.c:75</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_a8c7ddb39906f281b801f2cd58d416c2b"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a></div><div class="ttdeci">long MAX_N</div><div class="ttdoc">Limit of numbers to check.</div><div class="ttdef"><b>Definition:</b> sol2.c:17</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a5bc16eaf3ffe6a6ab66780dd445904c0"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a></div><div class="ttdeci">void shell_sort(int *array, long LEN)</div><div class="ttdoc">Optimized algorithm - takes half the time as other.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:31</div></div>
<div class="ttc" id="asol4_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol4.c:12</div></div>
<div class="ttc" id="ashell__sort2_8c_html_a4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:19</div></div>
<div class="ttc" id="amodified__binary__search_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:97</div></div>
<div class="ttc" id="aproblem__20_2sol1_8c_html_afc373c28da6b17636528edcc97fb5f86"><div class="ttname"><a href="../../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86">add_digit</a></div><div class="ttdeci">big_int * add_digit(big_int *digit, char value)</div><div class="ttdoc">Function that allocates memory to add another digit at the MSB.</div><div class="ttdef"><b>Definition:</b> sol1.c:37</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdoc">limit of range of matrix values</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:19</div></div>
<div class="ttc" id="abinary__search_8c_html_a908fd6d2ad0bba33f63f8454888a0032"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a></div><div class="ttdeci">int binarysearch2(const int *arr, int l, int r, int x)</div><div class="ttdoc">Iterative implementation.</div><div class="ttdef"><b>Definition:</b> binary_search.c:51</div></div>
<div class="ttc" id="abead__sort_8c_html_ad7ed8cc4603f500d610054680d28b971"><div class="ttname"><a href="../../d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">display</a></div><div class="ttdeci">void display(const int *arr, int n)</div><div class="ttdoc">Displays the array, passed to this method.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:19</div></div>
<div class="ttc" id="aqr__eigen__values_8c_html_a0d8ed79786d17df48396b333c09d05bb"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb">eigen_values</a></div><div class="ttdeci">double eigen_values(double **A, double *eigen_vals, int mat_size, char debug_print)</div><div class="ttdoc">Compute eigen values using iterative shifted QR decomposition algorithm as follows:</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.c:104</div></div>
<div class="ttc" id="agroup__sorting_html_ga4fdb8af29a07ac8f496e49a11bf9f1bd"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><div class="ttdeci">#define BEAD(i, j)</div><div class="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:16</div></div>
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_a8c66c03637e48e375b80b5d7791e57be"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be">test_c_atoi</a></div><div class="ttdeci">void test_c_atoi()</div><div class="ttdoc">test the function implementation</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:56</div></div>
<div class="ttc" id="agroup__sorting_html_ga5bc16eaf3ffe6a6ab66780dd445904c0"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort</a></div><div class="ttdeci">void shell_sort(int *array, long LEN)</div><div class="ttdoc">Shell sort algorithm.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:41</div></div>
<div class="ttc" id="aproblem__19_2sol1_8c_html_a6561b1adc8a19c092679b9874da24e2e"><div class="ttname"><a href="../../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e">is_leap_year</a></div><div class="ttdeci">char is_leap_year(short year)</div><div class="ttdoc">return 1 if input year is a leap year otherwise, return 0</div><div class="ttdef"><b>Definition:</b> sol1.c:41</div></div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a1aca7f530f82b27100262adba9e7556b"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><div class="ttdeci">char get_perfect_number(unsigned long N)</div><div class="ttdoc">Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.</div><div class="ttdef"><b>Definition:</b> sol1.c:21</div></div>
<div class="ttc" id="astructtnode_html"><div class="ttname"><a href="../../d8/d7a/structtnode.html">tnode</a></div><div class="ttdef"><b>Definition:</b> multikey_quick_sort.c:205</div></div>

4
globals_b.html
View File

@ -94,10 +94,10 @@ $(document).ready(function(){initNavTree('globals_b.html',''); initResizable();
<h3><a id="index_b"></a>- b -</h3><ul>
<li>BEAD
: <a class="el" href="d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">bead_sort.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">bead_sort.c</a>
</li>
<li>bead_sort()
: <a class="el" href="d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8">bead_sort.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort.c</a>
</li>
<li>big_int
: <a class="el" href="db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">sol1.c</a>

2
globals_d.html
View File

@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('globals_d.html',''); initResizable();
</li>
<li>display()
: <a class="el" href="dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">lu_decompose.c</a>
, <a class="el" href="d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">bead_sort.c</a>
, <a class="el" href="d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">bead_sort.c</a>
</li>
</ul>
</div><!-- contents -->

2
globals_defs.html
View File

@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
: <a class="el" href="da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020">adaline_learning.c</a>
</li>
<li>BEAD
: <a class="el" href="d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">bead_sort.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">bead_sort.c</a>
</li>
<li>EPSILON
: <a class="el" href="d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70">qr_eigen_values.c</a>

10
globals_func.html
View File

@ -128,7 +128,7 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
<h3><a id="index_b"></a>- b -</h3><ul>
<li>bead_sort()
: <a class="el" href="d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8">bead_sort.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8">bead_sort.c</a>
</li>
<li>binarySearch()
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">modified_binary_search.c</a>
@ -185,7 +185,7 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
</li>
<li>display()
: <a class="el" href="dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">lu_decompose.c</a>
, <a class="el" href="d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971">bead_sort.c</a>
, <a class="el" href="d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971">bead_sort.c</a>
</li>
</ul>
@ -463,11 +463,11 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
: <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb">ode_semi_implicit_euler.c</a>
</li>
<li>shell_sort()
: <a class="el" href="d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort2.c</a>
, <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63">sol1.c</a>
</li>
<li>show_data()
: <a class="el" href="d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">shell_sort2.c</a>
</li>
<li>sigma()
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sol1.c</a>
@ -488,7 +488,7 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
: <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sol1.c</a>
</li>
<li>swap()
: <a class="el" href="d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">shell_sort2.c</a>
</li>
</ul>

6
globals_s.html
View File

@ -112,11 +112,11 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
: <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb">ode_semi_implicit_euler.c</a>
</li>
<li>shell_sort()
: <a class="el" href="d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0">shell_sort2.c</a>
, <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63">sol1.c</a>
</li>
<li>show_data()
: <a class="el" href="d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f">shell_sort2.c</a>
</li>
<li>sigma()
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sol1.c</a>
@ -137,7 +137,7 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
: <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5">sol1.c</a>
</li>
<li>swap()
: <a class="el" href="d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">shell_sort2.c</a>
: <a class="el" href="d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8">shell_sort2.c</a>
</li>
</ul>
</div><!-- contents -->

1
modules.html
View File

@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('modules.html',''); initResizable(); })
<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a class="el" href="da/d2a/group__adaline.html" target="_self">Adaline learning algorithm</a></td><td class="desc"></td></tr>
<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a class="el" href="d1/d6b/group__kohonen__2d.html" target="_self">Kohonen SOM topology algorithm</a></td><td class="desc"></td></tr>
<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a class="el" href="d0/dcb/group__kohonen__1d.html" target="_self">Kohonen SOM trace/chain algorithm</a></td><td class="desc"></td></tr>
<tr id="row_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><a class="el" href="d5/d4c/group__sorting.html" target="_self">Sorting algorithms</a></td><td class="desc"></td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

3
modules.js
View File

@ -1,4 +1,5 @@
var modules =
[
[ "Machine learning algorithms", "d9/d66/group__machine__learning.html", "d9/d66/group__machine__learning" ]
[ "Machine learning algorithms", "d9/d66/group__machine__learning.html", "d9/d66/group__machine__learning" ],
[ "Sorting algorithms", "d5/d4c/group__sorting.html", "d5/d4c/group__sorting" ]
];

4
navtreedata.js
View File

@ -80,8 +80,8 @@ var NAVTREE =
var NAVTREEINDEX =
[
"annotated.html",
"d5/db4/struct_edge.html#ad7df434ff7710e69f28bb31e91a35f82",
"dir_2b14f32f14b51065d3a322bea21da3c0.html"
"d5/da1/structnode.html#a8139af7faac30d394e198365a999b54d",
"dir_167af11096b7752ff31b3d4bec489317.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

34
navtreeindex0.js
View File

@ -39,18 +39,18 @@ var NAVTREEINDEX0 =
"d0/d8a/structmax__heap.html#a917b63797e1857ce994dd5e6cfcebf1e":[11,0,17,0],
"d0/d8a/structmax__heap.html#ac4d520821651b109fd2ba2a99c6c6015":[11,0,17,2],
"d0/dcb/group__kohonen__1d.html":[10,0,9],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[10,0,9,3],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[12,0,4,2,5],
"d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586":[10,0,9,3],
"d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a":[10,0,9,6],
"d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a":[12,0,4,2,9],
"d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d":[12,0,4,2,2],
"d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d":[10,0,9,1],
"d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d":[12,0,4,2,2],
"d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f":[10,0,9,5],
"d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f":[12,0,4,2,7],
"d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde":[10,0,9,4],
"d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde":[12,0,4,2,6],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[12,0,4,2,3],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[10,0,9,2],
"d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485":[12,0,4,2,3],
"d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f":[10,0,9,0],
"d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f":[12,0,4,2,1],
"d0/df1/structhash__set__t.html":[11,0,14],
@ -112,10 +112,7 @@ var NAVTREEINDEX0 =
"d2/d93/problem__8_2sol2_8c.html":[12,0,7,21,1],
"d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[12,0,7,21,1,0],
"d2/da8/bead__sort_8c.html":[12,0,9,0],
"d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8":[12,0,9,0,1],
"d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd":[12,0,9,0,0],
"d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[12,0,9,0,3],
"d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971":[12,0,9,0,2],
"d2/daa/structadaline.html":[10,0,7,0],
"d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657":[10,0,7,0,2],
"d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1":[10,0,7,0,1],
@ -213,6 +210,19 @@ var NAVTREEINDEX0 =
"d4/dfe/struct_dict.html#add3f42ea66e92ce457a243d7534f5654":[11,0,8,1],
"d5/d23/qr__decomposition_8c.html":[12,0,6,7],
"d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,6,7,0],
"d5/d4c/group__sorting.html":[10,1],
"d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8":[12,0,9,0,1],
"d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8":[10,1,1],
"d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8":[12,0,9,1,3],
"d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8":[10,1,5],
"d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd":[12,0,9,0,0],
"d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd":[10,1,0],
"d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0":[12,0,9,1,1],
"d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0":[10,1,3],
"d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971":[10,1,2],
"d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971":[12,0,9,0,2],
"d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f":[12,0,9,1,2],
"d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f":[10,1,4],
"d5/d7e/struct_t.html":[11,0,26],
"d5/d7e/struct_t.html#a2023d2bb6a6cdf472b567b3ec5cf35d4":[11,0,26,0],
"d5/d7e/struct_t.html#a5a06d4022d41bad87137ba3430abce8b":[11,0,26,1],
@ -239,15 +249,5 @@ var NAVTREEINDEX0 =
"d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c":[11,0,20,10],
"d5/da1/structnode.html#a6f9100a3fe81d82776ce47ecdba94691":[11,0,20,1],
"d5/da1/structnode.html#a707bf3f1eeeaf8974e7e8e90f7bfd6a1":[11,0,20,12],
"d5/da1/structnode.html#a7f5750a90eac14a9a21d5b976cd8b8a7":[11,0,20,9],
"d5/da1/structnode.html#a8139af7faac30d394e198365a999b54d":[11,0,20,8],
"d5/da1/structnode.html#aaf2ec5ed1bb563465cbe2e9d16d74d1e":[11,0,20,11],
"d5/da1/structnode.html#ab4b1f345158daee0725acecd5ba817b1":[11,0,20,13],
"d5/da1/structnode.html#ac8973feda870a119ccdc25910254db0c":[11,0,20,3],
"d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0":[11,0,20,4],
"d5/db4/struct_edge.html":[11,0,10],
"d5/db4/struct_edge.html#a0c7bb90b11b1b795c665786317ca744d":[11,0,10,4],
"d5/db4/struct_edge.html#a2449478938136b5ab7ef0e7d92e6990b":[11,0,10,1],
"d5/db4/struct_edge.html#a4d58e1f4de38fa55549497175981ebab":[11,0,10,5],
"d5/db4/struct_edge.html#a9a415f211c059647d1b3af8fcf7a0e30":[11,0,10,2]
"d5/da1/structnode.html#a7f5750a90eac14a9a21d5b976cd8b8a7":[11,0,20,9]
};

26
navtreeindex1.js
View File

@ -1,5 +1,15 @@
var NAVTREEINDEX1 =
{
"d5/da1/structnode.html#a8139af7faac30d394e198365a999b54d":[11,0,20,8],
"d5/da1/structnode.html#aaf2ec5ed1bb563465cbe2e9d16d74d1e":[11,0,20,11],
"d5/da1/structnode.html#ab4b1f345158daee0725acecd5ba817b1":[11,0,20,13],
"d5/da1/structnode.html#ac8973feda870a119ccdc25910254db0c":[11,0,20,3],
"d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0":[11,0,20,4],
"d5/db4/struct_edge.html":[11,0,10],
"d5/db4/struct_edge.html#a0c7bb90b11b1b795c665786317ca744d":[11,0,10,4],
"d5/db4/struct_edge.html#a2449478938136b5ab7ef0e7d92e6990b":[11,0,10,1],
"d5/db4/struct_edge.html#a4d58e1f4de38fa55549497175981ebab":[11,0,10,5],
"d5/db4/struct_edge.html#a9a415f211c059647d1b3af8fcf7a0e30":[11,0,10,2],
"d5/db4/struct_edge.html#ad7df434ff7710e69f28bb31e91a35f82":[11,0,10,0],
"d5/db4/struct_edge.html#ae746ca841799f776a8add4d6fdfc19e9":[11,0,10,3],
"d6/d1b/sol4_8c.html":[12,0,7,0,3],
@ -22,9 +32,6 @@ var NAVTREEINDEX1 =
"d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,7,0,2,0],
"d6/ded/shell__sort2_8c.html":[12,0,9,1],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[12,0,9,1,0],
"d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8":[12,0,9,1,3],
"d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0":[12,0,9,1,1],
"d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f":[12,0,9,1,2],
"d6/df3/graph_8h_source.html":[12,0,1,4,0],
"d7/d1f/problem__12_2sol1_8c.html":[12,0,7,2,0],
"d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,7,2,0,1],
@ -107,10 +114,10 @@ var NAVTREEINDEX1 =
"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[10,0,7,4],
"da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[12,0,4,0,0],
"da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[10,0,7,1],
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[12,0,4,0,6],
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[10,0,7,7],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[10,0,7,9],
"da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[12,0,4,0,6],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[12,0,4,0,9],
"da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b":[10,0,7,9],
"da/d35/problem__1_2sol1_8c.html":[12,0,7,0,0],
"da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,7,0,0,0],
"da/d38/durand__kerner__roots_8c.html":[12,0,6,0],
@ -242,12 +249,5 @@ var NAVTREEINDEX1 =
"df/dea/structdata.html#ab1464d70ed28af0a16cdd2ebaa64027c":[11,0,7,0],
"dir_0472225043064b54f3dfff9011a9fae0.html":[12,0,1,7,0],
"dir_079e1f799fb08a8a0b98cb030ab15687.html":[12,0,7,13],
"dir_0bc3e2a5baf077fa21dadc079776fcac.html":[12,0,7,7],
"dir_167af11096b7752ff31b3d4bec489317.html":[12,0,7,19],
"dir_16b947d8e9a05fe119d0675493324331.html":[12,0,7,1],
"dir_16e00c78ef36d1842d0d8a4afc46b852.html":[12,0,7,14],
"dir_1833eb69ceee7a265ffba4c38c8243d2.html":[12,0,7,16],
"dir_18cba55772148686552805a354a79093.html":[12,0,7,6],
"dir_2176ba3565d8b1fe2a106d18679cc7bf.html":[12,0,1,7],
"dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html":[12,0,7,11]
"dir_0bc3e2a5baf077fa21dadc079776fcac.html":[12,0,7,7]
};

9
navtreeindex2.js
View File

@ -1,5 +1,12 @@
var NAVTREEINDEX2 =
{
"dir_167af11096b7752ff31b3d4bec489317.html":[12,0,7,19],
"dir_16b947d8e9a05fe119d0675493324331.html":[12,0,7,1],
"dir_16e00c78ef36d1842d0d8a4afc46b852.html":[12,0,7,14],
"dir_1833eb69ceee7a265ffba4c38c8243d2.html":[12,0,7,16],
"dir_18cba55772148686552805a354a79093.html":[12,0,7,6],
"dir_2176ba3565d8b1fe2a106d18679cc7bf.html":[12,0,1,7],
"dir_2abe2c0880d3fb0dba0f784bee3fc9e0.html":[12,0,7,11],
"dir_2b14f32f14b51065d3a322bea21da3c0.html":[12,0,7,5],
"dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html":[12,0,1],
"dir_2f070f19f76dfadabbc24fe483d7e98d.html":[12,0,7,17],
@ -40,8 +47,8 @@ var NAVTREEINDEX2 =
"files.html":[12,0],
"functions.html":[11,2,0],
"functions_vars.html":[11,2,1],
"globals.html":[12,1,0],
"globals.html":[12,1,0,0],
"globals.html":[12,1,0],
"globals_a.html":[12,1,0,1],
"globals_b.html":[12,1,0,2],
"globals_c.html":[12,1,0,3],

21
search/all_12.js
View File

@ -8,9 +8,9 @@ var searchData=
['search_174',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_175',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_176',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_177',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN):&#160;sol1.c'],['../d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN):&#160;shell_sort2.c']]],
['shell_5fsort_177',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN):&#160;sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN):&#160;shell_sort2.c']]],
['shell_5fsort2_2ec_178',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['show_5fdata_179',['show_data',['../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['show_5fdata_179',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_180',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_181',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['so1_2ec_182',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
@ -19,12 +19,13 @@ var searchData=
['sol2_2ec_185',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_186',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_187',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['stack_188',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['start_189',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
['stats_5fcomputer1_190',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_191',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['subset_192',['subset',['../dc/de5/structsubset.html',1,'']]],
['sum_5fof_5fdivisors_193',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_194',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_195',['swap',['../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
['sorting_20algorithms_188',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]],
['stack_189',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['start_190',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
['stats_5fcomputer1_191',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_192',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['subset_193',['subset',['../dc/de5/structsubset.html',1,'']]],
['sum_5fof_5fdivisors_194',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_195',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_196',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
];

34
search/all_13.js
View File

@ -1,20 +1,20 @@
var searchData=
[
['the_20algorithms_20_2d_20c_196',['The Algorithms - C',['../index.html',1,'']]],
['t_197',['T',['../d5/d7e/struct_t.html',1,'']]],
['test_198',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_199',['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'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_200',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.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'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_201',['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']]],
['test_5f2d_5fclasses_202',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_203',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_204',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_205',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_206',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_207',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_208',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_209',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
['threaded_5fbinary_5ftrees_2ec_210',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_211',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_212',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
['the_20algorithms_20_2d_20c_197',['The Algorithms - C',['../index.html',1,'']]],
['t_198',['T',['../d5/d7e/struct_t.html',1,'']]],
['test_199',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_200',['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'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_201',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.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'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_202',['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']]],
['test_5f2d_5fclasses_203',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_204',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_205',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_206',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_207',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_208',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_209',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_210',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
['threaded_5fbinary_5ftrees_2ec_211',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_212',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_213',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
];

10
search/all_14.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['value_213',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
['vector_5fdot_214',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_215',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fproj_216',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_217',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
['value_214',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
['vector_5fdot_215',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_216',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fproj_217',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_218',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
];

4
search/all_15.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['weights_218',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
['word_5fcount_5fword_219',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
['weights_219',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
['word_5fcount_5fword_220',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
];

4
search/all_2.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['bead_19',['BEAD',['../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd',1,'bead_sort.c']]],
['bead_5fsort_20',['bead_sort',['../d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
['bead_19',['BEAD',['../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd',1,'bead_sort.c']]],
['bead_5fsort_20',['bead_sort',['../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
['bead_5fsort_2ec_21',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['big_5fint_22',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]],
['binary_5fsearch_2ec_23',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]],

2
search/all_4.js
View File

@ -10,7 +10,7 @@ var searchData=
['dim1_49',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_50',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_51',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]],
['display_52',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c']]],
['display_52',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c']]],
['durand_5fkerner_5froots_2ec_53',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_54',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]],
['dictionary_55',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]

6
search/classes_0.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['_5fbig_5fint_220',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
['_5fcantor_5fset_221',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
['_5flarge_5fnum_222',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
['_5fbig_5fint_221',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
['_5fcantor_5fset_222',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
['_5flarge_5fnum_223',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
];

4
search/classes_1.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['adaline_223',['adaline',['../d2/daa/structadaline.html',1,'']]],
['avlnode_224',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
['adaline_224',['adaline',['../d2/daa/structadaline.html',1,'']]],
['avlnode_225',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
];

2
search/classes_10.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['word_5fcount_5fword_248',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
['word_5fcount_5fword_249',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
];

2
search/classes_2.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['bstiterator_225',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
['bstiterator_226',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
];

2
search/classes_3.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['carray_226',['CArray',['../d4/d2d/struct_c_array.html',1,'']]]
['carray_227',['CArray',['../d4/d2d/struct_c_array.html',1,'']]]
];

6
search/classes_4.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['data_227',['data',['../df/dea/structdata.html',1,'']]],
['dict_228',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dynamic_5farray_229',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
['data_228',['data',['../df/dea/structdata.html',1,'']]],
['dict_229',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dynamic_5farray_230',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
];

4
search/classes_5.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['edge_230',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['elem_231',['elem',['../d0/d6b/structelem.html',1,'']]]
['edge_231',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['elem_232',['elem',['../d0/d6b/structelem.html',1,'']]]
];

4
search/classes_6.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['graph_232',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_233',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
['graph_233',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_234',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
];

2
search/classes_7.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['hash_5fset_5ft_234',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]]
['hash_5fset_5ft_235',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]]
];

2
search/classes_8.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['kohonen_5farray_5f3d_235',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]]
['kohonen_5farray_5f3d_236',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]]
];

2
search/classes_9.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['l_236',['L',['../df/db3/struct_l.html',1,'']]]
['l_237',['L',['../df/db3/struct_l.html',1,'']]]
];

4
search/classes_a.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['max_5fheap_237',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
['min_5fheap_238',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
['max_5fheap_238',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
['min_5fheap_239',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
];

2
search/classes_b.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['node_239',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]]
['node_240',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]]
];

2
search/classes_c.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['pid_240',['pid',['../d0/d43/structpid.html',1,'']]]
['pid_241',['pid',['../d0/d43/structpid.html',1,'']]]
];

4
search/classes_d.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['queue_241',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_242',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
['queue_242',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_243',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
];

4
search/classes_e.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['stack_243',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['subset_244',['subset',['../dc/de5/structsubset.html',1,'']]]
['stack_244',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['subset_245',['subset',['../dc/de5/structsubset.html',1,'']]]
];

6
search/classes_f.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['t_245',['T',['../d5/d7e/struct_t.html',1,'']]],
['tnode_246',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_247',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
['t_246',['T',['../d5/d7e/struct_t.html',1,'']]],
['tnode_247',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_248',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
];

2
search/defines_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['_5fuse_5fmath_5fdefines_410',['_USE_MATH_DEFINES',['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_trace.c']]]
['_5fuse_5fmath_5fdefines_411',['_USE_MATH_DEFINES',['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES():&#160;kohonen_som_trace.c']]]
];

2
search/defines_1.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['accuracy_411',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;newton_raphson_root.c']]]
['accuracy_412',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;newton_raphson_root.c']]]
];

2
search/defines_2.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['bead_412',['BEAD',['../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd',1,'bead_sort.c']]]
['epsilon_413',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
];

2
search/defines_3.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['epsilon_413',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
['lims_414',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
];

8
search/defines_4.js
View File

@ -1,4 +1,10 @@
var searchData=
[
['lims_414',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
['max_5fdeno_415',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_416',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
['max_5fl_417',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]],
['max_5flen_418',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
['max_5fname_5flen_419',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
['max_5fnames_420',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
['mod_421',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]]
];

9
search/defines_5.js
View File

@ -1,10 +1,5 @@
var searchData=
[
['max_5fdeno_415',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_416',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
['max_5fl_417',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]],
['max_5flen_418',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
['max_5fname_5flen_419',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
['max_5fnames_420',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
['mod_421',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]]
['n_422',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
['n2_423',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]]
];

3
search/defines_6.js
View File

@ -1,5 +1,4 @@
var searchData=
[
['n_422',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
['n2_423',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]]
['order_424',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order():&#160;ode_semi_implicit_euler.c']]]
];

2
search/files_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['adaline_5flearning_2ec_249',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
['adaline_5flearning_2ec_250',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
];

4
search/files_1.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['bead_5fsort_2ec_250',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['binary_5fsearch_2ec_251',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]]
['bead_5fsort_2ec_251',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['binary_5fsearch_2ec_252',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]]
];

6
search/files_2.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['c_5fatoi_5fstr_5fto_5finteger_2ec_252',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_253',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['collatz_2ec_254',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
['c_5fatoi_5fstr_5fto_5finteger_2ec_253',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_254',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['collatz_2ec_255',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
];

2
search/files_3.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['durand_5fkerner_5froots_2ec_255',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]]
['durand_5fkerner_5froots_2ec_256',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]]
];

4
search/files_4.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['factorial_5flarge_5fnumber_2ec_256',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fibonacci_5ffast_2ec_257',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]]
['factorial_5flarge_5fnumber_2ec_257',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fibonacci_5ffast_2ec_258',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]]
];

4
search/files_5.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['kohonen_5fsom_5ftopology_2ec_258',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_259',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]]
['kohonen_5fsom_5ftopology_2ec_259',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_260',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]]
];

2
search/files_6.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['lu_5fdecompose_2ec_260',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
['lu_5fdecompose_2ec_261',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
];

2
search/files_7.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['modified_5fbinary_5fsearch_2ec_261',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]]
['modified_5fbinary_5fsearch_2ec_262',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]]
];

2
search/files_8.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['newton_5fraphson_5froot_2ec_262',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]]
['newton_5fraphson_5froot_2ec_263',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]]
];

6
search/files_9.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['ode_5fforward_5feuler_2ec_263',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_264',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_265',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]]
['ode_5fforward_5feuler_2ec_264',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_265',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_266',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]]
];

6
search/files_a.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['qr_5fdecompose_2eh_266',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_267',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_268',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]]
['qr_5fdecompose_2eh_267',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_268',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_269',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]]
];

2
search/files_b.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['realtime_5fstats_2ec_269',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
['realtime_5fstats_2ec_270',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
];

14
search/files_c.js
View File

@ -1,10 +1,10 @@
var searchData=
[
['shell_5fsort2_2ec_270',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['so1_2ec_271',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_272',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
['sol1_2ec_273',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
['sol2_2ec_274',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_275',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_276',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]]
['shell_5fsort2_2ec_271',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['so1_2ec_272',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_273',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]],
['sol1_2ec_274',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]],
['sol2_2ec_275',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]],
['sol3_2ec_276',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_277',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]]
];

2
search/files_d.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['threaded_5fbinary_5ftrees_2ec_277',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
['threaded_5fbinary_5ftrees_2ec_278',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
];

2
search/functions_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['_5frandom_278',['_random',['../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_trace.c']]]
['_5frandom_279',['_random',['../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_trace.c']]]
];

14
search/functions_1.js
View File

@ -1,10 +1,10 @@
var searchData=
[
['adaline_5factivation_279',['adaline_activation',['../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa',1,'adaline_learning.c']]],
['adaline_5ffit_280',['adaline_fit',['../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd',1,'adaline_learning.c']]],
['adaline_5ffit_5fsample_281',['adaline_fit_sample',['../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166',1,'adaline_learning.c']]],
['adaline_5fget_5fweights_5fstr_282',['adaline_get_weights_str',['../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120',1,'adaline_learning.c']]],
['adaline_5fpredict_283',['adaline_predict',['../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94',1,'adaline_learning.c']]],
['add_5fdigit_284',['add_digit',['../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3',1,'add_digit(large_num *num, unsigned int value):&#160;factorial_large_number.c'],['../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86',1,'add_digit(big_int *digit, char value):&#160;sol1.c']]],
['add_5fnumbers_285',['add_numbers',['../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2',1,'add_numbers(uint8_t *a, uint8_t *b, uint8_t N):&#160;sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c',1,'add_numbers(unsigned char *a, unsigned char *b, unsigned char *c, int N):&#160;sol1.c']]]
['adaline_5factivation_280',['adaline_activation',['../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa',1,'adaline_learning.c']]],
['adaline_5ffit_281',['adaline_fit',['../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd',1,'adaline_learning.c']]],
['adaline_5ffit_5fsample_282',['adaline_fit_sample',['../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166',1,'adaline_learning.c']]],
['adaline_5fget_5fweights_5fstr_283',['adaline_get_weights_str',['../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120',1,'adaline_learning.c']]],
['adaline_5fpredict_284',['adaline_predict',['../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94',1,'adaline_learning.c']]],
['add_5fdigit_285',['add_digit',['../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3',1,'add_digit(large_num *num, unsigned int value):&#160;factorial_large_number.c'],['../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86',1,'add_digit(big_int *digit, char value):&#160;sol1.c']]],
['add_5fnumbers_286',['add_numbers',['../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2',1,'add_numbers(uint8_t *a, uint8_t *b, uint8_t N):&#160;sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c',1,'add_numbers(unsigned char *a, unsigned char *b, unsigned char *c, int N):&#160;sol1.c']]]
];

30
search/functions_10.js
View File

@ -1,18 +1,18 @@
var searchData=
[
['save_5f2d_5fdata_356',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_357',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_358',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
['search_359',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_360',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_361',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_362',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN):&#160;sol1.c'],['../d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN):&#160;shell_sort2.c']]],
['show_5fdata_363',['show_data',['../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_364',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_365',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['stats_5fcomputer1_366',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_367',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['sum_5fof_5fdivisors_368',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_369',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_370',['swap',['../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
['save_5f2d_5fdata_357',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_358',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_359',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]],
['search_360',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_361',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_362',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_363',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN):&#160;sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN):&#160;shell_sort2.c']]],
['show_5fdata_364',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_365',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_366',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['stats_5fcomputer1_367',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_368',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['sum_5fof_5fdivisors_369',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_370',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_371',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
];

24
search/functions_11.js
View File

@ -1,15 +1,15 @@
var searchData=
[
['test_371',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_372',['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'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_373',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.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'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_374',['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']]],
['test_5f2d_5fclasses_375',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_376',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_377',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_378',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_379',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_380',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_381',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_382',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]]
['test_372',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_373',['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'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_374',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.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'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_375',['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']]],
['test_5f2d_5fclasses_376',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_377',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_378',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_379',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_380',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_381',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_382',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_383',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]]
];

8
search/functions_12.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['vector_5fdot_383',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_384',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fproj_385',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_386',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
['vector_5fdot_384',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_385',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fproj_386',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_387',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
];

8
search/functions_2.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['bead_5fsort_286',['bead_sort',['../d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
['binarysearch_287',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]],
['binarysearch1_288',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]],
['binarysearch2_289',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]]
['bead_5fsort_287',['bead_sort',['../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
['binarysearch_288',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]],
['binarysearch1_289',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]],
['binarysearch2_290',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]]
];

16
search/functions_3.js
View File

@ -1,11 +1,11 @@
var searchData=
[
['c_5fatoi_290',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]],
['check_5ftermination_291',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
['collatz_292',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['compare_293',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
['complex_5fstr_294',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
['count_5fdivisors_295',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['create_5fmatrix_296',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_297',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]]
['c_5fatoi_291',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]],
['check_5ftermination_292',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
['collatz_293',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['compare_294',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
['complex_5fstr_295',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
['count_5fdivisors_296',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['create_5fmatrix_297',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_298',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]]
];

10
search/functions_4.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['d_5ffunc_298',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
['delete_5fadaline_299',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_300',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_301',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['display_302',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c']]]
['d_5ffunc_299',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
['delete_5fadaline_300',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_301',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_302',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['display_303',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N):&#160;lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n):&#160;bead_sort.c']]]
];

4
search/functions_5.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['eigen_5fvalues_303',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
['exact_5fsolution_304',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_semi_implicit_euler.c']]]
['eigen_5fvalues_304',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
['exact_5fsolution_305',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y):&#160;ode_semi_implicit_euler.c']]]
];

10
search/functions_6.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['fib_305',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
['forward_5feuler_306',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
['forward_5feuler_5fstep_307',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
['free_5fmemory_308',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
['func_309',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]]
['fib_306',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
['forward_5feuler_307',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
['forward_5feuler_5fstep_308',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
['free_5fmemory_309',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
['func_310',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]]
];

20
search/functions_7.js
View File

@ -1,13 +1,13 @@
var searchData=
[
['gcd_310',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]],
['get_5fclock_5fdiff_311',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.c']]],
['get_5fdigits_312',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
['get_5fdivisors_313',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
['get_5fmin_5f2d_314',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
['get_5fmonth_5fdays_315',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
['get_5fnext_5fabundant_316',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol2.c']]],
['get_5fnumber_317',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
['get_5fperfect_5fnumber_318',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol2.c']]],
['get_5fproduct_319',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]]
['gcd_311',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]],
['get_5fclock_5fdiff_312',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.c']]],
['get_5fdigits_313',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
['get_5fdivisors_314',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
['get_5fmin_5f2d_315',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
['get_5fmonth_5fdays_316',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
['get_5fnext_5fabundant_317',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N):&#160;sol2.c']]],
['get_5fnumber_318',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
['get_5fperfect_5fnumber_319',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N):&#160;sol2.c']]],
['get_5fproduct_320',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]]
];

18
search/functions_8.js
View File

@ -1,12 +1,12 @@
var searchData=
[
['inorder_5fdisplay_320',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_5fbt_321',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['is_5fabundant_322',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N):&#160;sol2.c']]],
['is_5fin_323',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_324',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fpalindromic_325',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_326',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_327',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol2.c']]],
['isprime_328',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]]
['inorder_5fdisplay_321',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_5fbt_322',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['is_5fabundant_323',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N):&#160;sol2.c']]],
['is_5fin_324',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_325',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fpalindromic_326',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_327',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_328',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N):&#160;sol2.c']]],
['isprime_329',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]]
];

10
search/functions_9.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['kohonen_5fdata_5f3d_329',['kohonen_data_3d',['../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6',1,'kohonen_som_topology.c']]],
['kohonen_5fget_5fmin_5f1d_330',['kohonen_get_min_1d',['../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586',1,'kohonen_som_trace.c']]],
['kohonen_5fsom_331',['kohonen_som',['../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710',1,'kohonen_som_topology.c']]],
['kohonen_5fsom_5ftracer_332',['kohonen_som_tracer',['../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]],
['kohonen_5fupdate_5fweights_333',['kohonen_update_weights',['../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123',1,'kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f',1,'kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_trace.c']]]
['kohonen_5fdata_5f3d_330',['kohonen_data_3d',['../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6',1,'kohonen_som_topology.c']]],
['kohonen_5fget_5fmin_5f1d_331',['kohonen_get_min_1d',['../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586',1,'kohonen_som_trace.c']]],
['kohonen_5fsom_332',['kohonen_som',['../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710',1,'kohonen_som_topology.c']]],
['kohonen_5fsom_5ftracer_333',['kohonen_som_tracer',['../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]],
['kohonen_5fupdate_5fweights_334',['kohonen_update_weights',['../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123',1,'kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f',1,'kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_trace.c']]]
];

6
search/functions_a.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['lazy_5fsort_334',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_335',['lcm',['../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol.c']]],
['lu_5fdecomposition_336',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
['lazy_5fsort_335',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_336',['lcm',['../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol.c']]],
['lu_5fdecomposition_337',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]]
];

12
search/functions_b.js
View File

File diff suppressed because one or more lines are too long

6
search/functions_c.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['new_5fadaline_343',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
['new_5fnumber_344',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
['number_5fof_5fpaths_345',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
['new_5fadaline_344',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
['new_5fnumber_345',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
['number_5fof_5fpaths_346',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
];

16
search/functions_d.js
View File

@ -1,11 +1,11 @@
var searchData=
[
['poly_5ffunction_346',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['postorder_5fdisplay_347',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['preorder_5fdisplay_348',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['print_349',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'cantor_set.c']]],
['print_5fmatrix_350',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_351',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print):&#160;sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N):&#160;sol1.c']]],
['problem_352',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_semi_implicit_euler.c']]],
['propagate_353',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]]
['poly_5ffunction_347',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['postorder_5fdisplay_348',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['preorder_5fdisplay_349',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['print_350',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'cantor_set.c']]],
['print_5fmatrix_351',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_352',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print):&#160;sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N):&#160;sol1.c']]],
['problem_353',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy):&#160;ode_semi_implicit_euler.c']]],
['propagate_354',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]]
];

2
search/functions_e.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['qr_5fdecompose_354',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]]
['qr_5fdecompose_355',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]]
];

2
search/functions_f.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['remove_5fdigits_355',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]]
['remove_5fdigits_356',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]]
];

36
search/groups_3.html Normal file
View File

@ -0,0 +1,36 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html><head><title></title>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<link rel="stylesheet" type="text/css" href="search.css"/>
<script type="text/javascript" src="groups_3.js"></script>
<script type="text/javascript" src="search.js"></script>
</head>
<body class="SRPage">
<div id="SRIndex">
<div class="SRStatus" id="Loading">Loading...</div>
<div id="SRResults"></div>
<script type="text/javascript"><!--
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
createResults();
/* @license-end */
--></script>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
<script type="text/javascript"><!--
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
document.getElementById("Loading").style.display="none";
document.getElementById("NoMatches").style.display="none";
var searchResults = new SearchResults("searchResults");
searchResults.Search();
window.addEventListener("message", function(event) {
if (event.data == "take_focus") {
var elem = searchResults.NavNext(0);
if (elem) elem.focus();
}
});
/* @license-end */
--></script>
</div>
</body>
</html>

4
search/groups_3.js Normal file
View File

@ -0,0 +1,4 @@
var searchData=
[
['sorting_20algorithms_429',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]]
];

2
search/pages_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['array_429',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]]
['array_430',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]]
];

2
search/pages_1.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['code_20style_20convention_430',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]]
['code_20style_20convention_431',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]]
];

2
search/pages_2.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['dictionary_431',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]
['dictionary_432',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]
];

2
search/pages_3.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['hash_20algorithms_432',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]]
['hash_20algorithms_433',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]]
];

4
search/pages_4.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['list_20of_20all_20files_433',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
['leetcode_434',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]]
['list_20of_20all_20files_434',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
['leetcode_435',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]]
];

2
search/pages_5.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['projecteuler_435',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]]
['projecteuler_436',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]]
];

4
search/pages_6.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['simple_20generic_20stack_436',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]],
['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_437',['Sample solutions for &lt;a href=&quot;http://exercism.io/&quot;&gt;exercism.io&lt;/a&gt;',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]]
['simple_20generic_20stack_437',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]],
['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_438',['Sample solutions for &lt;a href=&quot;http://exercism.io/&quot;&gt;exercism.io&lt;/a&gt;',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]]
];

2
search/pages_7.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['the_20algorithms_20_2d_20c_438',['The Algorithms - C',['../index.html',1,'']]]
['the_20algorithms_20_2d_20c_439',['The Algorithms - C',['../index.html',1,'']]]
];

4
search/searchdata.js
View File

@ -6,8 +6,8 @@ var indexSectionsWithContent =
3: "_abcdefgiklmnpqrstv",
4: "adelmnprsvw",
5: "bcln",
6: "_abelmno",
7: "akm",
6: "_aelmno",
7: "akms",
8: "acdhlpst"
};

2
search/typedefs_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['big_5fint_406',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]]
['big_5fint_407',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]]
];

2
search/typedefs_1.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['cantorset_407',['CantorSet',['../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94',1,'cantor_set.c']]]
['cantorset_408',['CantorSet',['../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94',1,'cantor_set.c']]]
];

2
search/typedefs_2.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['large_5fnum_408',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]]
['large_5fnum_409',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]]
];

2
search/typedefs_3.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['node_409',['node',['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'threaded_binary_trees.c']]]
['node_410',['node',['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'threaded_binary_trees.c']]]
];

2
search/variables_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['abundant_5fflags_387',['abundant_flags',['../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06',1,'sol2.c']]]
['abundant_5fflags_388',['abundant_flags',['../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06',1,'sol2.c']]]
];

10
search/variables_1.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['data_388',['data',['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59',1,'kohonen_array_3d::data()']]],
['digits_389',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_390',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_391',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_392',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]]
['data_389',['data',['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59',1,'kohonen_array_3d::data()']]],
['digits_390',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_391',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]],
['dim2_392',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]],
['dim3_393',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]]
];

Some files were not shown because too many files have changed in this diff Show More