mirrors
/
TheAlgorithms-C
mirror of https://github.com/TheAlgorithms/C
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Documentation for 9a58248668

This commit is contained in:
github-actions 2020-07-02 14:50:38 +00:00
parent ae9bb44d19
commit 60a3c8a371
140 changed files with 1402 additions and 491 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

265
d2/da8/bead__sort_8c.html Normal file
View File

@ -0,0 +1,265 @@
<!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/bead_sort.c File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr 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('d2/da8/bead__sort_8c.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<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">bead_sort.c File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort">bead sort</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for bead_sort.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/ddb/bead__sort_8c__incl.svg" width="160" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a 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/d46/kohonen__som__trace_8c.html#affe776513b24d84b39af8ab0930fef7f">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>
</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: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>
<tr class="separator:ac0f2228420376f4db7e1274f2b41667c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>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="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">max</a>)</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <a class="code" href="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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><!-- 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="akohonen__som__topology_8c_html_affe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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:32</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d2/da8/bead__sort_8c.html">bead_sort.c</a></li>
<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>

7
d2/da8/bead__sort_8c.js Normal file
View File

@ -0,0 +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 ],
[ "main", "d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c", null ]
];

325
d3/d47/modified__binary__search_8c.html Normal file
View File

@ -0,0 +1,325 @@
<!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: searching/modified_binary_search.c File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr 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('d3/d47/modified__binary__search_8c.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">modified_binary_search.c File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p><a href="https://arxiv.org/abs/1406.1677">Modified binary search algorithm</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for modified_binary_search.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dee/modified__binary__search_8c__incl.svg" width="160" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a0cfaa56aacf960e4628a0fb27add8890"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a> (const int **mat, int i, int j_low, int j_high, int x)</td></tr>
<tr class="memdesc:a0cfaa56aacf960e4628a0fb27add8890"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function does Binary search for <code>x</code> in <code>i</code>-th row from <code>j_low</code> to <code>j_high</code>. <a href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">More...</a><br /></td></tr>
<tr class="separator:a0cfaa56aacf960e4628a0fb27add8890"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7df9a198e30cded6229d79bef7591f8f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modifiedBinarySearch</a> (const int **mat, int n, int m, int x)</td></tr>
<tr class="memdesc:a7df9a198e30cded6229d79bef7591f8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to perform binary search on the mid values of row to get the desired pair of rows where the element can be found. <a href="../../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">More...</a><br /></td></tr>
<tr class="separator:a7df9a198e30cded6229d79bef7591f8f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top"><a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://arxiv.org/abs/1406.1677">Modified binary search algorithm</a> </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a0cfaa56aacf960e4628a0fb27add8890"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0cfaa56aacf960e4628a0fb27add8890">&#9670;&nbsp;</a></span>binarySearch()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int binarySearch </td>
<td>(</td>
<td class="paramtype">const int **&#160;</td>
<td class="paramname"><em>mat</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>j_low</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>j_high</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function does Binary search for <code>x</code> in <code>i</code>-th row from <code>j_low</code> to <code>j_high</code>. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">mat</td><td>2D matrix to search within </td></tr>
<tr><td class="paramname">i</td><td>row to search in </td></tr>
<tr><td class="paramname">j_low</td><td>start column index </td></tr>
<tr><td class="paramname">j_high</td><td>end column index </td></tr>
<tr><td class="paramname">x</td><td>value to search for </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>column where <code>x</code> was found </dd>
<dd>
-1 if value not found </dd></dl>
<div class="fragment"><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;{</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160; <span class="keywordflow">while</span> (j_low &lt;= j_high)</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; {</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; <span class="keywordtype">int</span> j_mid = (j_low + j_high) / 2;</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; </div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; <span class="comment">// Element found</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <span class="keywordflow">if</span> (mat[i][j_mid] == x)</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;Found at (%d,%d)\n&quot;</span>, i, j_mid);</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <span class="keywordflow">return</span> j_mid;</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; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mat[i][j_mid] &gt; x)</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; j_high = j_mid - 1;</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; j_low = j_mid + 1;</div>
<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; </div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="comment">// element not found</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; printf(<span class="stringliteral">&quot;element not found\n&quot;</span>);</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a7df9a198e30cded6229d79bef7591f8f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7df9a198e30cded6229d79bef7591f8f">&#9670;&nbsp;</a></span>modifiedBinarySearch()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void modifiedBinarySearch </td>
<td>(</td>
<td class="paramtype">const int **&#160;</td>
<td class="paramname"><em>mat</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>m</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to perform binary search on the mid values of row to get the desired pair of rows where the element can be found. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">mat</td><td>matrix to search for the value in </td></tr>
<tr><td class="paramdir"></td><td class="paramname">n</td><td>number of rows in the matrix </td></tr>
<tr><td class="paramdir"></td><td class="paramname">m</td><td>number of columns in the matrix </td></tr>
<tr><td class="paramdir"></td><td class="paramname">x</td><td>value to search for </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160;{ <span class="comment">// If Single row matrix</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">if</span> (n == 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; <a class="code" href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a>(mat, 0, 0, m - 1, x);</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; }</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">// Do binary search in middle column.</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="comment">// Condition to terminate the loop when the 2 desired rows are found.</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordtype">int</span> i_low = 0, i_high = n - 1, j_mid = m / 2;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">while</span> ((i_low + 1) &lt; i_high)</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; {</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordtype">int</span> i_mid = (i_low + i_high) / 2;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="comment">// element found</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">if</span> (mat[i_mid][j_mid] == x)</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; {</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; printf(<span class="stringliteral">&quot;Found at (%d,%d)\n&quot;</span>, i_mid, j_mid);</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordflow">return</span>;</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; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mat[i_mid][j_mid] &gt; x)</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; i_high = i_mid;</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; i_low = i_mid;</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; }</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="comment">// If element is present on the mid of the two rows</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">if</span> (mat[i_low][j_mid] == x)</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; printf(<span class="stringliteral">&quot;Found at (%d,%d)\n&quot;</span>, i_low, j_mid);</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mat[i_low + 1][j_mid] == x)</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; printf(<span class="stringliteral">&quot;Found at (%d,%d)\n&quot;</span>, i_low + 1, j_mid);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// Search element on 1st half of 1st row</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &lt;= mat[i_low][j_mid - 1])</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="code" href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a>(mat, i_low, 0, j_mid - 1, x);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; </div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="comment">// Search element on 2nd half of 1st row</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &gt;= mat[i_low][j_mid + 1] &amp;&amp; x &lt;= mat[i_low][m - 1])</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <a class="code" href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a>(mat, i_low, j_mid + 1, m - 1, x);</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; </div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="comment">// Search element on 1st half of 2nd row</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &lt;= mat[i_low + 1][j_mid - 1])</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <a class="code" href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a>(mat, i_low + 1, 0, j_mid - 1, x);</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="comment">// search element on 2nd half of 2nd row</span></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <a class="code" href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a>(mat, i_low + 1, j_mid + 1, m - 1, x);</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d47/modified__binary__search_8c_a7df9a198e30cded6229d79bef7591f8f_cgraph.svg" width="307" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="amodified__binary__search_8c_html_a0cfaa56aacf960e4628a0fb27add8890"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a></div><div class="ttdeci">int binarySearch(const int **mat, int i, int j_low, int j_high, int x)</div><div class="ttdoc">This function does Binary search for x in i-th row from j_low to j_high.</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:18</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_da574daf9ce9c05b45556bdc871ed1e3.html">searching</a></li><li class="navelem"><a class="el" href="../../d3/d47/modified__binary__search_8c.html">modified_binary_search.c</a></li>
<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>

6
d3/d47/modified__binary__search_8c.js vendored Normal file
View File

@ -0,0 +1,6 @@
var modified__binary__search_8c =
[
[ "binarySearch", "d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890", null ],
[ "main", "d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "modifiedBinarySearch", "d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f", null ]
];

4
d3/d47/modified__binary__search_8c_a7df9a198e30cded6229d79bef7591f8f_cgraph.map Normal file
View File

@ -0,0 +1,4 @@
<map id="modifiedBinarySearch" name="modifiedBinarySearch">
<area shape="rect" id="node1" title="Function to perform binary search on the mid values of row to get the desired pair of rows where the ..." alt="" coords="5,5,155,32"/>
<area shape="rect" id="node2" href="$d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890" title="This function does Binary search for x in i&#45;th row from j_low to j_high." alt="" coords="203,5,301,32"/>
</map>

1
d3/d47/modified__binary__search_8c_a7df9a198e30cded6229d79bef7591f8f_cgraph.md5 Normal file
View File

@ -0,0 +1 @@
510891992180070de3ed4aeddf11a76e

37
d3/d47/modified__binary__search_8c_a7df9a198e30cded6229d79bef7591f8f_cgraph.svg Normal file
View File

@ -0,0 +1,37 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.0 (20200408.0750)
-->
<!-- Title: modifiedBinarySearch Pages: 1 -->
<svg width="230pt" height="28pt"
viewBox="0.00 0.00 230.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>modifiedBinarySearch</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 226,-24 226,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function to perform binary search on the mid values of row to get the desired pair of rows where the ...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 112,-19.5 112,-0.5 0,-0.5"/>
<text text-anchor="middle" x="56" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">modifiedBinarySearch</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890" target="_top" xlink:title="This function does Binary search for x in i&#45;th row from j_low to j_high.">
<polygon fill="white" stroke="black" points="148,-0.5 148,-19.5 222,-19.5 222,-0.5 148,-0.5"/>
<text text-anchor="middle" x="185" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">binarySearch</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M112.33,-10C120.79,-10 129.45,-10 137.69,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="137.86,-13.5 147.86,-10 137.86,-6.5 137.86,-13.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

5
d3/ddb/bead__sort_8c__incl.map Normal file
View File

@ -0,0 +1,5 @@
<map id="sorting/bead_sort.c" name="sorting/bead_sort.c">
<area shape="rect" id="node1" title="Sorting of array list using bead sort" alt="" coords="12,5,145,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,67,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="91,80,155,107"/>
</map>

1
d3/ddb/bead__sort_8c__incl.md5 Normal file
View File

@ -0,0 +1 @@
aa627af09db8f9bce3d7343432d56a0d

52
d3/ddb/bead__sort_8c__incl.svg Normal file
View File

@ -0,0 +1,52 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.0 (20200408.0750)
-->
<!-- Title: sorting/bead_sort.c Pages: 1 -->
<svg width="120pt" height="84pt"
viewBox="0.00 0.00 120.00 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
<title>sorting/bead_sort.c</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 116,-80 116,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Sorting of array list using bead sort">
<polygon fill="#bfbfbf" stroke="black" points="5,-56.5 5,-75.5 105,-75.5 105,-56.5 5,-56.5"/>
<text text-anchor="middle" x="55" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">sorting/bead_sort.c</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 46,-19.5 46,-0.5 0,-0.5"/>
<text text-anchor="middle" x="23" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M49.72,-56.08C45.29,-48.61 38.84,-37.72 33.38,-28.52"/>
<polygon fill="midnightblue" stroke="midnightblue" points="36.29,-26.57 28.19,-19.75 30.27,-30.14 36.29,-26.57"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="64,-0.5 64,-19.5 112,-19.5 112,-0.5 64,-0.5"/>
<text text-anchor="middle" x="88" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdlib.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M60.45,-56.08C65.01,-48.61 71.67,-37.72 77.29,-28.52"/>
<polygon fill="midnightblue" stroke="midnightblue" points="80.42,-30.11 82.65,-19.75 74.45,-26.46 80.42,-30.11"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.2 KiB

2
d4/d68/qr__decompose_8h_source.html
View File

@ -333,7 +333,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="akohonen__som__topology_8c_html_ad9e25202bb8b481461f932668f249dbc"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(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_topology.c:452</div></div>
<div class="ttc" id="akohonen__som__trace_8c_html_a9c98203f55242ff7a8f45a6370840e66"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a9c98203f55242ff7a8f45a6370840e66">update_weights</a></div><div class="ttdeci">void update_weights(double const *x, double *const *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_trace.c:123</div></div>
<div class="ttc" id="astruct_b_s_t_iterator_html"><div class="ttname"><a href="../../d4/d02/struct_b_s_t_iterator.html">BSTIterator</a></div><div class="ttdoc">Definition for a binary tree node.</div><div class="ttdef"><b>Definition:</b> 173.c:13</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_adf4ae062a028c6faf2b96c9c1eb343af"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">poly_function</a></div><div class="ttdeci">long double complex poly_function(double *coeffs, unsigned int degree, long double complex x)</div><div class="ttdoc">Evaluate the value of a polynomial with given coefficients.</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:50</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="aqr__decompose_8h_html_a82b20e027437df768d7e994cf4cae29f"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a></div><div class="ttdeci">double * vector_proj(double *a, double *b, double *out, int L)</div><div class="ttdoc">Compute projection of vector on defined as.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:76</div></div>
<div class="ttc" id="acantor__set_8c_html_a85df3c64a683100ac6246e1e034df43d"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d">free_memory</a></div><div class="ttdeci">void free_memory(CantorSet *head)</div><div class="ttdoc">Clear memory allocated by propagate function.</div><div class="ttdef"><b>Definition:</b> cantor_set.c:72</div></div>
@ -351,6 +350,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="afactorial__large__number_8c_html_ad8101f58545bd891ae8b6e11caadd7eb"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb">new_number</a></div><div class="ttdeci">large_num * new_number(void)</div><div class="ttdoc">create a new large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:24</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_a26d5695ebed0818a3e7cf4b10aacab52"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52">check_termination</a></div><div class="ttdeci">char check_termination(long double delta)</div><div class="ttdoc">check for termination condition</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:83</div></div>
<div class="ttc" id="aode__semi__implicit__euler_8c_html_ad80059877222f885b549f2d0a3dc6b55"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55">semi_implicit_euler</a></div><div class="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><div class="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:109</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_a321f9781a9744ccdaf0aba89f35ec29c"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">poly_function</a></div><div class="ttdeci">long double complex poly_function(long double *coeffs, unsigned int degree, long double complex x)</div><div class="ttdoc">Evaluate the value of a polynomial with given coefficients.</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:50</div></div>
<div class="ttc" id="afactorial__large__number_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_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> factorial_large_number.c:94</div></div>
<div class="ttc" id="afactorial__large__number_8c_html_ad398ddbd594ca69a5e6dfc894925341e"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e">multiply</a></div><div class="ttdeci">void multiply(large_num *num, unsigned long n)</div><div class="ttdoc">multiply large number with another integer and store the result in the same large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:66</div></div>
<div class="ttc" id="akohonen__som__trace_8c_html_af5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#af5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdoc">Helper function to generate a random number in a given interval.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:48</div></div>

5
d4/dee/modified__binary__search_8c__incl.map Normal file
View File

@ -0,0 +1,5 @@
<map id="searching/modified_binary_search.c" name="searching/modified_binary_search.c">
<area shape="rect" id="node1" title="Modified binary search algorithm" alt="" coords="13,5,144,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,67,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="91,95,155,121"/>
</map>

1
d4/dee/modified__binary__search_8c__incl.md5 Normal file
View File

@ -0,0 +1 @@
4a66d8fb0ea221abe6144352d19a2534

53
d4/dee/modified__binary__search_8c__incl.svg Normal file
View File

@ -0,0 +1,53 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.0 (20200408.0750)
-->
<!-- Title: searching/modified_binary_search.c Pages: 1 -->
<svg width="120pt" height="95pt"
viewBox="0.00 0.00 120.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>searching/modified_binary_search.c</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 116,-91 116,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Modified binary search algorithm">
<polygon fill="#bfbfbf" stroke="black" points="6,-56.5 6,-86.5 104,-86.5 104,-56.5 6,-56.5"/>
<text text-anchor="start" x="14" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">searching/modified</text>
<text text-anchor="middle" x="55" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_binary_search.c</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 46,-19.5 46,-0.5 0,-0.5"/>
<text text-anchor="middle" x="23" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M47.42,-56.4C42.96,-48.11 37.28,-37.55 32.52,-28.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="35.48,-26.81 27.66,-19.66 29.31,-30.12 35.48,-26.81"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="64,-0.5 64,-19.5 112,-19.5 112,-0.5 64,-0.5"/>
<text text-anchor="middle" x="88" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdlib.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M62.82,-56.4C67.47,-48.02 73.4,-37.33 78.34,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="81.41,-30.1 83.2,-19.66 75.29,-26.71 81.41,-30.1"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.3 KiB

7
d7/dd8/c__atoi__str__to__integer_8c.html
View File

@ -254,6 +254,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aqr__eigen__values_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">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> qr_eigen_values.c:297</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_adf2a0717e3307419a9d7c52707f5631e"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e">MAX_L</a></div><div class="ttdeci">#define MAX_L</div><div class="ttdoc">chunk size of array allocation</div><div class="ttdef"><b>Definition:</b> sol1.c:18</div></div>
<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="amodified__binary__search_8c_html_a7df9a198e30cded6229d79bef7591f8f"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modifiedBinarySearch</a></div><div class="ttdeci">void modifiedBinarySearch(const int **mat, int n, int m, int x)</div><div class="ttdoc">Function to perform binary search on the mid values of row to get the desired pair of rows where the ...</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:48</div></div>
<div class="ttc" id="aproblem__23_2sol2_8c_html_a1aca7f530f82b27100262adba9e7556b"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><div class="ttdeci">char get_perfect_number(unsigned long N)</div><div class="ttdef"><b>Definition:</b> sol2.c:33</div></div>
<div class="ttc" id="aproblem__22_2sol1_8c_html_ae359b8a4656b164c91ef91a084c15c9d"><div class="ttname"><a href="../../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d">lazy_sort</a></div><div class="ttdeci">void lazy_sort(char data[][MAX_NAME_LEN], int LEN)</div><div class="ttdoc">Alphabetical sorting using 'lazy sort' algorithm.</div><div class="ttdef"><b>Definition:</b> sol1.c:48</div></div>
<div class="ttc" id="aso1_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> so1.c:17</div></div>
@ -280,6 +281,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>
@ -288,6 +290,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_a248adc917818cc6666d8bc679a660319"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a></div><div class="ttdeci">int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)</div><div class="ttdoc">Function to print a long number.</div><div class="ttdef"><b>Definition:</b> sol1.c:82</div></div>
<div class="ttc" id="asol3_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> sol3.c:14</div></div>
<div class="ttc" id="aproblem__21_2sol1_8c_html_aacf4b7e708651d2164e86958f2c29c93"><div class="ttname"><a href="../../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93">sum_of_divisors</a></div><div class="ttdeci">unsigned long sum_of_divisors(unsigned int N)</div><div class="ttdoc">function to return the sum of proper divisors of N</div><div class="ttdef"><b>Definition:</b> sol1.c:13</div></div>
<div class="ttc" id="amodified__binary__search_8c_html_a0cfaa56aacf960e4628a0fb27add8890"><div class="ttname"><a href="../../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">binarySearch</a></div><div class="ttdeci">int binarySearch(const int **mat, int i, int j_low, int j_high, int x)</div><div class="ttdoc">This function does Binary search for x in i-th row from j_low to j_high.</div><div class="ttdef"><b>Definition:</b> modified_binary_search.c:18</div></div>
<div class="ttc" id="aproblem__401_2sol1_8c_html_aaf964739be92adc2f500e7da11e3f6be"><div class="ttname"><a href="../../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be">sigma</a></div><div class="ttdeci">uint64_t sigma(uint64_t N)</div><div class="ttdoc">sum of squares of factors of numbers from 1 thru N</div><div class="ttdef"><b>Definition:</b> sol1.c:108</div></div>
<div class="ttc" id="aproblem__3_2sol1_8c_html_aa0f4796aa2e89c327f827bd55f5cb305"><div class="ttname"><a href="../../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">isprime</a></div><div class="ttdeci">char isprime(int no)</div><div class="ttdoc">Check if the given number is prime.</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
<div class="ttc" id="aproblem__20_2sol1_8c_html_a62cbbd106aad52daadb9403a07d0da32"><div class="ttname"><a href="../../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">big_int</a></div><div class="ttdeci">struct _big_int big_int</div><div class="ttdoc">store arbitratily large integer values as a linked list of digits.</div></div>
@ -311,8 +314,10 @@ 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="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="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>
@ -320,9 +325,11 @@ Here is the call graph for this function:</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="akohonen__som__topology_8c_html_affe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">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:32</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="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="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>

26
da/d38/durand__kerner__roots_8c.html
View File

@ -123,9 +123,9 @@ Macros</h2></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:adf4ae062a028c6faf2b96c9c1eb343af"><td class="memItemLeft" align="right" valign="top">long double complex&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">poly_function</a> (double *coeffs, unsigned int degree, long double complex x)</td></tr>
<tr class="memdesc:adf4ae062a028c6faf2b96c9c1eb343af"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluate the value of a polynomial with given coefficients. <a href="../../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">More...</a><br /></td></tr>
<tr class="separator:adf4ae062a028c6faf2b96c9c1eb343af"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a321f9781a9744ccdaf0aba89f35ec29c"><td class="memItemLeft" align="right" valign="top">long double complex&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">poly_function</a> (long double *coeffs, unsigned int degree, long double complex x)</td></tr>
<tr class="memdesc:a321f9781a9744ccdaf0aba89f35ec29c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluate the value of a polynomial with given coefficients. <a href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">More...</a><br /></td></tr>
<tr class="separator:a321f9781a9744ccdaf0aba89f35ec29c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afa5b04ce11475d67049cba8273741fb7"><td class="memItemLeft" align="right" valign="top">const char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7">complex_str</a> (long double complex x)</td></tr>
<tr class="memdesc:afa5b04ce11475d67049cba8273741fb7"><td class="mdescLeft">&#160;</td><td class="mdescRight">create a textual form of complex number <a href="../../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7">More...</a><br /></td></tr>
<tr class="separator:afa5b04ce11475d67049cba8273741fb7"><td class="memSeparator" colspan="2">&#160;</td></tr>
@ -250,7 +250,7 @@ approximations" style="pointer-events: none;" width="400" class="inline"/> </p>
</div><div class="memdoc">
<p>store intermediate values to a CSV file</p>
<div class="fragment"><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;{</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keywordtype">double</span> *coeffs = NULL;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keywordtype">long</span> <span class="keywordtype">double</span> *coeffs = NULL;</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="keywordtype">long</span> <span class="keywordtype">double</span> complex *s0 = NULL;</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> degree = 0;</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n, i;</div>
@ -264,8 +264,8 @@ approximations" style="pointer-events: none;" width="400" class="inline"/> </p>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; }</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; degree = argc - 1; <span class="comment">/* detected polynomial degree */</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; coeffs = (<span class="keywordtype">double</span> *)malloc(</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; degree * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>)); <span class="comment">/* store all input coefficients */</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; coeffs = (<span class="keywordtype">long</span> <span class="keywordtype">double</span> *)malloc(</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; degree * <span class="keyword">sizeof</span>(<span class="keywordtype">long</span> <span class="keywordtype">double</span>)); <span class="comment">/* store all input coefficients */</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; s0 = (<span class="keywordtype">long</span> <span class="keywordtype">double</span> complex *)malloc(</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; (degree - 1) *</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keyword">sizeof</span>(<span class="keywordtype">long</span> <span class="keywordtype">double</span> complex)); <span class="comment">/* number of roots = degree-1 */</span></div>
@ -303,9 +303,9 @@ approximations" style="pointer-events: none;" width="400" class="inline"/> </p>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; {</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; coeffs[n] = strtod(argv[n + 1], NULL);</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; <span class="keywordflow">if</span> (n &lt; degree - 1 &amp;&amp; coeffs[n] != 0)</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; printf(<span class="stringliteral">&quot;(%g) x^%d + &quot;</span>, coeffs[n], degree - n - 1);</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; printf(<span class="stringliteral">&quot;(%Lg) x^%d + &quot;</span>, coeffs[n], degree - n - 1);</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coeffs[n] != 0)</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; printf(<span class="stringliteral">&quot;(%g) x^%d = 0\n&quot;</span>, coeffs[n], degree - n - 1);</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; printf(<span class="stringliteral">&quot;(%Lg) x^%d = 0\n&quot;</span>, coeffs[n], degree - n - 1);</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; </div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="keywordtype">double</span> tmp;</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; <span class="keywordflow">if</span> (n &gt; 0)</div>
@ -351,7 +351,7 @@ approximations" style="pointer-events: none;" width="400" class="inline"/> </p>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; <span class="keywordflow">for</span> (n = 0; n &lt; degree - 1; n++)</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordtype">long</span> <span class="keywordtype">double</span> complex numerator =</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <a class="code" href="../../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">poly_function</a>(coeffs, degree, s0[n]);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <a class="code" href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">poly_function</a>(coeffs, degree, s0[n]);</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordtype">long</span> <span class="keywordtype">double</span> complex denominator = 1.0;</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordflow">for</span> (i = 0; i &lt; degree - 1; i++)</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; <span class="keywordflow">if</span> (i != n)</div>
@ -415,8 +415,8 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="adf4ae062a028c6faf2b96c9c1eb343af"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adf4ae062a028c6faf2b96c9c1eb343af">&#9670;&nbsp;</a></span>poly_function()</h2>
<a id="a321f9781a9744ccdaf0aba89f35ec29c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a321f9781a9744ccdaf0aba89f35ec29c">&#9670;&nbsp;</a></span>poly_function()</h2>
<div class="memitem">
<div class="memproto">
@ -424,7 +424,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">long double complex poly_function </td>
<td>(</td>
<td class="paramtype">double *&#160;</td>
<td class="paramtype">long double *&#160;</td>
<td class="paramname"><em>coeffs</em>, </td>
</tr>
<tr>
@ -470,9 +470,9 @@ Here is the call graph for this function:</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="adurand__kerner__roots_8c_html_adf4ae062a028c6faf2b96c9c1eb343af"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">poly_function</a></div><div class="ttdeci">long double complex poly_function(double *coeffs, unsigned int degree, long double complex x)</div><div class="ttdoc">Evaluate the value of a polynomial with given coefficients.</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:50</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_afa5b04ce11475d67049cba8273741fb7"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7">complex_str</a></div><div class="ttdeci">const char * complex_str(long double complex x)</div><div class="ttdoc">create a textual form of complex number</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:66</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_a26d5695ebed0818a3e7cf4b10aacab52"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52">check_termination</a></div><div class="ttdeci">char check_termination(long double delta)</div><div class="ttdoc">check for termination condition</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:83</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_a321f9781a9744ccdaf0aba89f35ec29c"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">poly_function</a></div><div class="ttdeci">long double complex poly_function(long double *coeffs, unsigned int degree, long double complex x)</div><div class="ttdoc">Evaluate the value of a polynomial with given coefficients.</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:50</div></div>
<div class="ttc" id="adurand__kerner__roots_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">maximum accuracy limit</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:41</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

2
da/d38/durand__kerner__roots_8c.js vendored
View File

@ -4,5 +4,5 @@ var durand__kerner__roots_8c =
[ "check_termination", "da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52", null ],
[ "complex_str", "da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7", null ],
[ "main", "da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", null ],
[ "poly_function", "da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af", null ]
[ "poly_function", "da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c", null ]
];

2
da/d38/durand__kerner__roots_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
View File

@ -2,5 +2,5 @@
<area shape="rect" id="node1" title=" " alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52" title="check for termination condition" alt="" coords="104,5,232,32"/>
<area shape="rect" id="node3" href="$da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7" title="create a textual form of complex number" alt="" coords="121,56,215,83"/>
<area shape="rect" id="node4" href="$da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af" title="Evaluate the value of a polynomial with given coefficients." alt="" coords="119,107,217,133"/>
<area shape="rect" id="node4" href="$da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c" title="Evaluate the value of a polynomial with given coefficients." alt="" coords="119,107,217,133"/>
</map>

2
da/d38/durand__kerner__roots_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
View File

@ -1 +1 @@
b10211da01894eb059879b3b45b90f84
bc9b81851cf25e8c6f3a27e95f35f3bc

2
da/d38/durand__kerner__roots_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
View File

@ -51,7 +51,7 @@
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af" target="_top" xlink:title="Evaluate the value of a polynomial with given coefficients.">
<g id="a_node4"><a xlink:href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c" target="_top" xlink:title="Evaluate the value of a polynomial with given coefficients.">
<polygon fill="white" stroke="black" points="85,-0.5 85,-19.5 159,-19.5 159,-0.5 85,-0.5"/>
<text text-anchor="middle" x="122" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
</a>

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

3
dir_bb1b521853a9c46347182a9d10420771.html
View File

@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('dir_bb1b521853a9c46347182a9d10420771.h
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a>
Files</h2></td></tr>
<tr class="memitem:d2/da8/bead__sort_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/da8/bead__sort_8c.html">bead_sort.c</a></td></tr>
<tr class="memdesc:d2/da8/bead__sort_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort">bead sort</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d6/ded/shell__sort2_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/ded/shell__sort2_8c.html">shell_sort2.c</a></td></tr>
<tr class="memdesc:d6/ded/shell__sort2_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Shell_sort">Shell sort algorithm</a> implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_bb1b521853a9c46347182a9d10420771.js
View File

@ -1,4 +1,5 @@
var dir_bb1b521853a9c46347182a9d10420771 =
[
[ "bead_sort.c", "d2/da8/bead__sort_8c.html", "d2/da8/bead__sort_8c" ],
[ "shell_sort2.c", "d6/ded/shell__sort2_8c.html", "d6/ded/shell__sort2_8c" ]
];

3
dir_da574daf9ce9c05b45556bdc871ed1e3.html
View File

@ -103,6 +103,9 @@ Files</h2></td></tr>
<tr class="memitem:df/d3b/binary__search_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d3b/binary__search_8c.html">binary_search.c</a></td></tr>
<tr class="memdesc:df/d3b/binary__search_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm">binary search</a> of a target value in a given <em>sorted</em> array. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d3/d47/modified__binary__search_8c"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d47/modified__binary__search_8c.html">modified_binary_search.c</a></td></tr>
<tr class="memdesc:d3/d47/modified__binary__search_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://arxiv.org/abs/1406.1677">Modified binary search algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->

3
dir_da574daf9ce9c05b45556bdc871ed1e3.js
View File

@ -1,4 +1,5 @@
var dir_da574daf9ce9c05b45556bdc871ed1e3 =
[
[ "binary_search.c", "df/d3b/binary__search_8c.html", "df/d3b/binary__search_8c" ]
[ "binary_search.c", "df/d3b/binary__search_8c.html", "df/d3b/binary__search_8c" ],
[ "modified_binary_search.c", "d3/d47/modified__binary__search_8c.html", "d3/d47/modified__binary__search_8c" ]
];

6
files.html
View File

@ -208,8 +208,10 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_7_22_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/de0/problem__9_2sol2_8c.html" target="_self">sol2.c</a></td><td class="desc"><a href="https://projecteuler.net/problem=9">Problem 9</a> solution </td></tr>
<tr id="row_8_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9660;</span><span id="img_8_" class="iconfopen" onclick="toggleFolder('8_')">&#160;</span><a class="el" href="dir_da574daf9ce9c05b45556bdc871ed1e3.html" target="_self">searching</a></td><td class="desc"></td></tr>
<tr id="row_8_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d3b/binary__search_8c.html" target="_self">binary_search.c</a></td><td class="desc">Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm">binary search</a> of a target value in a given <em>sorted</em> array </td></tr>
<tr id="row_9_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span id="img_9_" class="iconfopen" onclick="toggleFolder('9_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
<tr id="row_9_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort">Shell sort algorithm</a> implementation </td></tr>
<tr id="row_8_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d47/modified__binary__search_8c.html" target="_self">modified_binary_search.c</a></td><td class="desc"><a href="https://arxiv.org/abs/1406.1677">Modified binary search algorithm</a> </td></tr>
<tr id="row_9_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span id="img_9_" class="iconfopen" onclick="toggleFolder('9_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
<tr id="row_9_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/da8/bead__sort_8c.html" target="_self">bead_sort.c</a></td><td class="desc">Sorting of array list using <a href="https://en.wikipedia.org/wiki/Bead_sort">bead sort</a> </td></tr>
<tr id="row_9_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort">Shell sort algorithm</a> implementation </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

9
globals_b.html
View File

@ -93,9 +93,18 @@ $(document).ready(function(){initNavTree('globals_b.html',''); initResizable();
<div class="textblock">Here is a list of all documented functions, variables, defines, enums, and typedefs with links to the documentation:</div>
<h3><a id="index_b"></a>- b -</h3><ul>
<li>BEAD
: <a class="el" href="d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">bead_sort.c</a>
</li>
<li>bead_sort()
: <a class="el" href="d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8">bead_sort.c</a>
</li>
<li>big_int
: <a class="el" href="db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32">sol1.c</a>
</li>
<li>binarySearch()
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">modified_binary_search.c</a>
</li>
<li>binarysearch1()
: <a class="el" href="df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binary_search.c</a>
</li>

1
globals_d.html
View File

@ -110,6 +110,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>
</li>
</ul>
</div><!-- contents -->

7
globals_defs.html
View File

@ -97,8 +97,11 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
</li>
<li>ACCURACY
: <a class="el" href="dd/d8c/adaline__learning_8c.html#af270a96662132d0385cb6b4637c5a689">adaline_learning.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689">newton_raphson_root.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689">durand_kerner_roots.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689">newton_raphson_root.c</a>
</li>
<li>BEAD
: <a class="el" href="d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd">bead_sort.c</a>
</li>
<li>EPSILON
: <a class="el" href="d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70">qr_eigen_values.c</a>
@ -146,8 +149,8 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
</li>
<li>order
: <a class="el" href="d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_forward_euler.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_semi_implicit_euler.c</a>
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_midpoint_euler.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">ode_semi_implicit_euler.c</a>
</li>
</ul>
</div><!-- contents -->

56
globals_func.html
View File

@ -115,6 +115,12 @@ $(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>
</li>
<li>binarySearch()
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890">modified_binary_search.c</a>
</li>
<li>binarysearch1()
: <a class="el" href="df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binary_search.c</a>
</li>
@ -170,6 +176,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>
</li>
</ul>
@ -314,43 +321,47 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
<li>main()
: <a class="el" href="d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">c_atoi_str_to_integer.c</a>
, <a class="el" href="df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">threaded_binary_trees.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.c</a>
, <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
, <a class="el" href="dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">collatz.c</a>
, <a class="el" href="d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97">factorial_large_number.c</a>
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
, <a class="el" href="dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">realtime_stats.c</a>
, <a class="el" href="d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">collatz.c</a>
, <a class="el" href="d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">bead_sort.c</a>
, <a class="el" href="d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modified_binary_search.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">newton_raphson_root.c</a>
, <a class="el" href="d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.c</a>
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.c</a>
, <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
, <a class="el" href="df/de7/problem__5_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">realtime_stats.c</a>
, <a class="el" href="d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol3.c</a>
, <a class="el" href="d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol4.c</a>
, <a class="el" href="d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97">fibonacci_fast.c</a>
, <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="df/d1a/problem__21_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.c</a>
, <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">so1.c</a>
, <a class="el" href="df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol2.c</a>
, <a class="el" href="d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
, <a class="el" href="db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="df/de7/problem__5_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97">fibonacci_fast.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.c</a>
, <a class="el" href="d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol2.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe">binary_search.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
, <a class="el" href="d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">shell_sort2.c</a>
</li>
<li>mat_mul()
@ -362,6 +373,9 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
<li>midpoint_euler_step()
: <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51">ode_midpoint_euler.c</a>
</li>
<li>modifiedBinarySearch()
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modified_binary_search.c</a>
</li>
<li>multiply()
: <a class="el" href="d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e">factorial_large_number.c</a>
</li>
@ -383,7 +397,7 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
<h3><a id="index_p"></a>- p -</h3><ul>
<li>poly_function()
: <a class="el" href="da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">durand_kerner_roots.c</a>
: <a class="el" href="da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">durand_kerner_roots.c</a>
</li>
<li>postorder_display()
: <a class="el" href="df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719">threaded_binary_trees.c</a>

26
globals_m.html
View File

@ -108,28 +108,31 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.c</a>
, <a class="el" href="da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">durand_kerner_roots.c</a>
, <a class="el" href="d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">shell_sort2.c</a>
, <a class="el" href="d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c">bead_sort.c</a>
, <a class="el" href="d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modified_binary_search.c</a>
, <a class="el" href="df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe">binary_search.c</a>
, <a class="el" href="d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol2.c</a>
, <a class="el" href="df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol2.c</a>
, <a class="el" href="d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol.c</a>
, <a class="el" href="d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol3.c</a>
, <a class="el" href="d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.c</a>
, <a class="el" href="d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sol4.c</a>
, <a class="el" href="d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol1.c</a>
, <a class="el" href="dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.c</a>
, <a class="el" href="dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">cantor_set.c</a>
, <a class="el" href="dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">newton_raphson_root.c</a>
, <a class="el" href="d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">so1.c</a>
, <a class="el" href="dd/df0/problem__19_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97">sol2.c</a>
, <a class="el" href="d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">sol1.c</a>
, <a class="el" href="d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.c</a>
, <a class="el" href="db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">sol1.c</a>
, <a class="el" href="dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">collatz.c</a>
, <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.c</a>
, <a class="el" href="d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.c</a>
@ -138,8 +141,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9">qr_eigen_values.c</a>
</li>
<li>max
: <a class="el" href="d0/d46/kohonen__som__trace_8c.html#affe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>
: <a class="el" href="d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#affe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a>
</li>
<li>MAX_DENO
: <a class="el" href="d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">sol1.c</a>
@ -157,8 +160,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">sol1.c</a>
</li>
<li>MAX_N
: <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">sol1.c</a>
, <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">sol2.c</a>
: <a class="el" href="d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">sol2.c</a>
, <a class="el" href="d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">sol1.c</a>
</li>
<li>MAX_NAME_LEN
: <a class="el" href="dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a">sol1.c</a>
@ -173,12 +176,15 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51">ode_midpoint_euler.c</a>
</li>
<li>min
: <a class="el" href="d2/df6/kohonen__som__topology_8c.html#ac6afabdc09a49a433ee19d8a9486056d">kohonen_som_topology.c</a>
, <a class="el" href="d0/d46/kohonen__som__trace_8c.html#ac6afabdc09a49a433ee19d8a9486056d">kohonen_som_trace.c</a>
: <a class="el" href="d0/d46/kohonen__som__trace_8c.html#ac6afabdc09a49a433ee19d8a9486056d">kohonen_som_trace.c</a>
, <a class="el" href="d2/df6/kohonen__som__topology_8c.html#ac6afabdc09a49a433ee19d8a9486056d">kohonen_som_topology.c</a>
</li>
<li>MOD
: <a class="el" href="d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319">sol1.c</a>
</li>
<li>modifiedBinarySearch()
: <a class="el" href="d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f">modified_binary_search.c</a>
</li>
<li>multiply()
: <a class="el" href="d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e">factorial_large_number.c</a>
</li>

2
globals_p.html
View File

@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
<h3><a id="index_p"></a>- p -</h3><ul>
<li>poly_function()
: <a class="el" href="da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af">durand_kerner_roots.c</a>
: <a class="el" href="da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">durand_kerner_roots.c</a>
</li>
<li>postorder_display()
: <a class="el" href="df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719">threaded_binary_trees.c</a>

4
navtreedata.js
View File

@ -79,8 +79,8 @@ var NAVTREE =
var NAVTREEINDEX =
[
"annotated.html",
"d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8",
"functions.html"
"d6/d42/structdynamic__array.html#a7e3fbd203b3b86401c17dede7a33f781",
"dir_d9112ab06cf4d4e5a25d385a268d1949.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

20
navtreeindex0.js
View File

@ -89,6 +89,11 @@ var NAVTREEINDEX0 =
"d2/d71/struct_a_v_lnode.html#af7b887a7fffb15778d53e167a95e40d9":[10,0,12,0],
"d2/d93/problem__8_2sol2_8c.html":[11,0,7,21,1],
"d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,7,21,1,0],
"d2/da8/bead__sort_8c.html":[11,0,9,0],
"d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8":[11,0,9,0,1],
"d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd":[11,0,9,0,0],
"d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[11,0,9,0,3],
"d2/da8/bead__sort_8c.html#ad7ed8cc4603f500d610054680d28b971":[11,0,9,0,2],
"d2/daa/structadaline.html":[10,0,10],
"d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657":[10,0,10,2],
"d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1":[10,0,10,1],
@ -117,6 +122,10 @@ var NAVTREEINDEX0 =
"d2/df6/kohonen__som__topology_8c.html#adee1bc3871c881f6e04cb9e0b1d01158":[11,0,4,1,11],
"d2/df6/kohonen__som__topology_8c.html#af5ce14f026d6d231bef29161bac2b485":[11,0,4,1,4],
"d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f":[11,0,4,1,2],
"d3/d47/modified__binary__search_8c.html":[11,0,8,1],
"d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890":[11,0,8,1,0],
"d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f":[11,0,8,1,2],
"d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,1,1],
"d3/d5a/struct__large__num.html":[10,0,9],
"d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0":[10,0,9,1],
"d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9":[10,0,9,0],
@ -240,14 +249,5 @@ var NAVTREEINDEX0 =
"d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb":[11,0,5,2,6],
"d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3":[11,0,5,2,2],
"d6/d42/structdynamic__array.html":[10,0,17],
"d6/d42/structdynamic__array.html#a79c587474e35f99510ca3018bf700007":[10,0,17,2],
"d6/d42/structdynamic__array.html#a7e3fbd203b3b86401c17dede7a33f781":[10,0,17,1],
"d6/d42/structdynamic__array.html#a9ddb0f64ade5d5e74b7fd091158958e4":[10,0,17,0],
"d6/d48/isogram_8h_source.html":[11,0,2,2,0],
"d6/d88/problem__16_2sol1_8c.html":[11,0,7,6,0],
"d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,7,6,0,0],
"d6/de3/sol3_8c.html":[11,0,7,0,2],
"d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,2,0],
"d6/ded/shell__sort2_8c.html":[11,0,9,0],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,9,0,0]
"d6/d42/structdynamic__array.html#a79c587474e35f99510ca3018bf700007":[10,0,17,2]
};

28
navtreeindex1.js
View File

@ -1,8 +1,17 @@
var NAVTREEINDEX1 =
{
"d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8":[11,0,9,0,3],
"d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0":[11,0,9,0,1],
"d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f":[11,0,9,0,2],
"d6/d42/structdynamic__array.html#a7e3fbd203b3b86401c17dede7a33f781":[10,0,17,1],
"d6/d42/structdynamic__array.html#a9ddb0f64ade5d5e74b7fd091158958e4":[10,0,17,0],
"d6/d48/isogram_8h_source.html":[11,0,2,2,0],
"d6/d88/problem__16_2sol1_8c.html":[11,0,7,6,0],
"d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,7,6,0,0],
"d6/de3/sol3_8c.html":[11,0,7,0,2],
"d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,2,0],
"d6/ded/shell__sort2_8c.html":[11,0,9,1],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,9,1,0],
"d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8":[11,0,9,1,3],
"d6/ded/shell__sort2_8c.html#a5bc16eaf3ffe6a6ab66780dd445904c0":[11,0,9,1,1],
"d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f":[11,0,9,1,2],
"d6/df3/graph_8h_source.html":[11,0,1,4,0],
"d7/d1f/problem__12_2sol1_8c.html":[11,0,7,2,0],
"d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,7,2,0,1],
@ -68,8 +77,8 @@ var NAVTREEINDEX1 =
"da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,0,0],
"da/d38/durand__kerner__roots_8c.html":[11,0,6,0],
"da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52":[11,0,6,0,1],
"da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c":[11,0,6,0,4],
"da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,6,0,3],
"da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af":[11,0,6,0,4],
"da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689":[11,0,6,0,0],
"da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7":[11,0,6,0,2],
"da/d90/stack__linked__list_2stack_8h_source.html":[11,0,1,7,0,0],
@ -240,14 +249,5 @@ var NAVTREEINDEX1 =
"dir_bb1b521853a9c46347182a9d10420771.html":[11,0,9],
"dir_bd4a7dd282074645ef41b1ea31ac813a.html":[11,0,1,3],
"dir_c7ef0fcb2f2095a74f0a3a1634dfc798.html":[11,0,1,0],
"dir_d4c35186c199e728d69dee6bf5b2473c.html":[11,0,7,22],
"dir_d9112ab06cf4d4e5a25d385a268d1949.html":[11,0,7,2],
"dir_d9e100c82ada2163abea49688a71e81c.html":[11,0,7,10],
"dir_da574daf9ce9c05b45556bdc871ed1e3.html":[11,0,8],
"dir_e39df94f82619fa5256f1786519937be.html":[11,0,1,1],
"dir_eeeea13e3a5e5edad3499183767ce312.html":[11,0,7,8],
"dir_f75ccd45e00436eafed446b9b2682984.html":[11,0,7,12],
"dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html":[11,0,7,3],
"dir_fe5d69ed7d90cb356556070c2a2e5478.html":[11,0,2,0],
"files.html":[11,0]
"dir_d4c35186c199e728d69dee6bf5b2473c.html":[11,0,7,22]
};

11
navtreeindex2.js
View File

@ -1,9 +1,18 @@
var NAVTREEINDEX2 =
{
"dir_d9112ab06cf4d4e5a25d385a268d1949.html":[11,0,7,2],
"dir_d9e100c82ada2163abea49688a71e81c.html":[11,0,7,10],
"dir_da574daf9ce9c05b45556bdc871ed1e3.html":[11,0,8],
"dir_e39df94f82619fa5256f1786519937be.html":[11,0,1,1],
"dir_eeeea13e3a5e5edad3499183767ce312.html":[11,0,7,8],
"dir_f75ccd45e00436eafed446b9b2682984.html":[11,0,7,12],
"dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html":[11,0,7,3],
"dir_fe5d69ed7d90cb356556070c2a2e5478.html":[11,0,2,0],
"files.html":[11,0],
"functions.html":[10,2,0],
"functions_vars.html":[10,2,1],
"globals.html":[11,1,0],
"globals.html":[11,1,0,0],
"globals.html":[11,1,0],
"globals_a.html":[11,1,0,1],
"globals_b.html":[11,1,0,2],
"globals_c.html":[11,1,0,3],

12
search/all_10.js
View File

@ -1,9 +1,9 @@
var searchData=
[
['qr_5fdecompose_149',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]],
['qr_5fdecompose_2eh_150',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_151',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_152',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]],
['queue_153',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_154',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
['qr_5fdecompose_155',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]],
['qr_5fdecompose_2eh_156',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_157',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_158',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]],
['queue_159',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_160',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
];

6
search/all_11.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['realtime_5fstats_2ec_155',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]],
['remove_5fdigits_156',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]],
['rlink_157',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]]
['realtime_5fstats_2ec_161',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]],
['remove_5fdigits_162',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]],
['rlink_163',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]]
];

54
search/all_12.js
View File

@ -1,30 +1,30 @@
var searchData=
[
['simple_20generic_20stack_158',['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_159',['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,'']]],
['save_5f2d_5fdata_160',['save_2d_data',['../d2/df6/kohonen__som__topology_8c.html#a6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_161',['save_nd_data',['../d0/d46/kohonen__som__trace_8c.html#a7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_162',['save_u_matrix',['../d2/df6/kohonen__som__topology_8c.html#adee1bc3871c881f6e04cb9e0b1d01158',1,'kohonen_som_topology.c']]],
['search_163',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_164',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_165',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_166',['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_5fsort2_2ec_167',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['show_5fdata_168',['show_data',['../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_169',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_170',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['so1_2ec_171',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_172',['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_173',['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_174',['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_175',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_176',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['stack_177',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['start_178',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
['stats_5fcomputer1_179',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_180',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['subset_181',['subset',['../dc/de5/structsubset.html',1,'']]],
['sum_5fof_5fdivisors_182',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_183',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_184',['swap',['../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
['simple_20generic_20stack_164',['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_165',['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,'']]],
['save_5f2d_5fdata_166',['save_2d_data',['../d2/df6/kohonen__som__topology_8c.html#a6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_167',['save_nd_data',['../d0/d46/kohonen__som__trace_8c.html#a7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_168',['save_u_matrix',['../d2/df6/kohonen__som__topology_8c.html#adee1bc3871c881f6e04cb9e0b1d01158',1,'kohonen_som_topology.c']]],
['search_169',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_170',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_171',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_172',['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_5fsort2_2ec_173',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['show_5fdata_174',['show_data',['../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_175',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_176',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['so1_2ec_177',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_178',['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_179',['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_180',['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_181',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_182',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]],
['stack_183',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['start_184',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]],
['stats_5fcomputer1_185',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_186',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['subset_187',['subset',['../dc/de5/structsubset.html',1,'']]],
['sum_5fof_5fdivisors_188',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_189',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_190',['swap',['../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
];

34
search/all_13.js
View File

@ -1,20 +1,20 @@
var searchData=
[
['the_20algorithms_20_2d_20c_185',['The Algorithms - C',['../index.html',1,'']]],
['t_186',['T',['../d5/d7e/struct_t.html',1,'']]],
['test_187',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_188',['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_189',['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_190',['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_191',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_192',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_193',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_194',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_195',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_196',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_197',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_198',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
['threaded_5fbinary_5ftrees_2ec_199',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_200',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_201',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
['the_20algorithms_20_2d_20c_191',['The Algorithms - C',['../index.html',1,'']]],
['t_192',['T',['../d5/d7e/struct_t.html',1,'']]],
['test_193',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_194',['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_195',['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_196',['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_197',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_198',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_199',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_200',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_201',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_202',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_203',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_204',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]],
['threaded_5fbinary_5ftrees_2ec_205',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_206',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_207',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
];

2
search/all_14.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['update_5fweights_202',['update_weights',['../d2/df6/kohonen__som__topology_8c.html#ad139de302fa8135a433d9c1bf971b13b',1,'update_weights(const double *X, struct array_3d *W, double **D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a9c98203f55242ff7a8f45a6370840e66',1,'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']]]
['update_5fweights_208',['update_weights',['../d2/df6/kohonen__som__topology_8c.html#ad139de302fa8135a433d9c1bf971b13b',1,'update_weights(const double *X, struct array_3d *W, double **D, int num_out, int num_features, double alpha, int R):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a9c98203f55242ff7a8f45a6370840e66',1,'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']]]
];

10
search/all_15.js
View File

@ -1,8 +1,8 @@
var searchData=
[
['value_203',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
['vector_5fdot_204',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_205',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fproj_206',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_207',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
['value_209',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]],
['vector_5fdot_210',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]],
['vector_5fmag_211',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]],
['vector_5fproj_212',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]],
['vector_5fsub_213',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]]
];

4
search/all_16.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['weights_208',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
['word_5fcount_5fword_209',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
['weights_214',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]],
['word_5fcount_5fword_215',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]]
];

14
search/all_2.js
View File

@ -1,8 +1,12 @@
var searchData=
[
['big_5fint_15',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]],
['binary_5fsearch_2ec_16',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]],
['binarysearch1_17',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]],
['binarysearch2_18',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]],
['bstiterator_19',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
['bead_15',['BEAD',['../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd',1,'bead_sort.c']]],
['bead_5fsort_16',['bead_sort',['../d2/da8/bead__sort_8c.html#a2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]],
['bead_5fsort_2ec_17',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['big_5fint_18',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]],
['binary_5fsearch_2ec_19',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]],
['binarysearch_20',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]],
['binarysearch1_21',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]],
['binarysearch2_22',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]],
['bstiterator_23',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]]
];

28
search/all_3.js
View File

@ -1,17 +1,17 @@
var searchData=
[
['c_5fatoi_20',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]],
['c_5fatoi_5fstr_5fto_5finteger_2ec_21',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_22',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['cantorset_23',['CantorSet',['../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94',1,'cantor_set.c']]],
['carray_24',['CArray',['../d4/d2d/struct_c_array.html',1,'']]],
['check_5ftermination_25',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
['collatz_26',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['collatz_2ec_27',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]],
['compare_28',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
['complex_5fstr_29',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
['count_5fdivisors_30',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['create_5fmatrix_31',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_32',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]],
['code_20style_20convention_33',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]]
['c_5fatoi_24',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]],
['c_5fatoi_5fstr_5fto_5finteger_2ec_25',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_26',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['cantorset_27',['CantorSet',['../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94',1,'cantor_set.c']]],
['carray_28',['CArray',['../d4/d2d/struct_c_array.html',1,'']]],
['check_5ftermination_29',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]],
['collatz_30',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]],
['collatz_2ec_31',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]],
['compare_32',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]],
['complex_5fstr_33',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]],
['count_5fdivisors_34',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]],
['create_5fmatrix_35',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]],
['create_5fnode_36',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]],
['code_20style_20convention_37',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]]
];

30
search/all_4.js
View File

@ -1,18 +1,18 @@
var searchData=
[
['d_5ffunc_34',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
['data_35',['data',['../df/dea/structdata.html',1,'data'],['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d0/dc8/structarray__3d.html#ac8967b2c72769f839c09fb4cebb4339f',1,'array_3d::data()']]],
['data_5f3d_36',['data_3d',['../d2/df6/kohonen__som__topology_8c.html#a7237d2cf3b3f9d034477268c1d6631da',1,'kohonen_som_topology.c']]],
['delete_5fadaline_37',['delete_adaline',['../dd/d8c/adaline__learning_8c.html#a6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_38',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_39',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['dict_40',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['digits_41',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_42',['dim1',['../d0/dc8/structarray__3d.html#ad5d3ee546eea3c05dc8f0dc90ec194f4',1,'array_3d']]],
['dim2_43',['dim2',['../d0/dc8/structarray__3d.html#aa431cc0a41fd379270dbd2b0e3ac1b45',1,'array_3d']]],
['dim3_44',['dim3',['../d0/dc8/structarray__3d.html#ad823bd5424a0fc158da52a0497d8c10a',1,'array_3d']]],
['display_45',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'lu_decompose.c']]],
['durand_5fkerner_5froots_2ec_46',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_47',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]],
['dictionary_48',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]
['d_5ffunc_38',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]],
['data_39',['data',['../df/dea/structdata.html',1,'data'],['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d0/dc8/structarray__3d.html#ac8967b2c72769f839c09fb4cebb4339f',1,'array_3d::data()']]],
['data_5f3d_40',['data_3d',['../d2/df6/kohonen__som__topology_8c.html#a7237d2cf3b3f9d034477268c1d6631da',1,'kohonen_som_topology.c']]],
['delete_5fadaline_41',['delete_adaline',['../dd/d8c/adaline__learning_8c.html#a6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]],
['delete_5fbt_42',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]],
['delete_5fnumber_43',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]],
['dict_44',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['digits_45',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]],
['dim1_46',['dim1',['../d0/dc8/structarray__3d.html#ad5d3ee546eea3c05dc8f0dc90ec194f4',1,'array_3d']]],
['dim2_47',['dim2',['../d0/dc8/structarray__3d.html#aa431cc0a41fd379270dbd2b0e3ac1b45',1,'array_3d']]],
['dim3_48',['dim3',['../d0/dc8/structarray__3d.html#ad823bd5424a0fc158da52a0497d8c10a',1,'array_3d']]],
['display_49',['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']]],
['durand_5fkerner_5froots_2ec_50',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]],
['dynamic_5farray_51',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]],
['dictionary_52',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]]
];

14
search/all_5.js
View File

@ -1,10 +1,10 @@
var searchData=
[
['edge_49',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['eigen_5fvalues_50',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
['elem_51',['elem',['../d0/d6b/structelem.html',1,'']]],
['end_52',['end',['../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def',1,'_cantor_set']]],
['epsilon_53',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]],
['eta_54',['eta',['../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2',1,'adaline']]],
['exact_5fsolution_55',['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']]]
['edge_53',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['eigen_5fvalues_54',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]],
['elem_55',['elem',['../d0/d6b/structelem.html',1,'']]],
['end_56',['end',['../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def',1,'_cantor_set']]],
['epsilon_57',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]],
['eta_58',['eta',['../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2',1,'adaline']]],
['exact_5fsolution_59',['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']]]
];

18
search/all_6.js
View File

@ -1,12 +1,12 @@
var searchData=
[
['factorial_5flarge_5fnumber_2ec_56',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fib_57',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
['fibonacci_5ffast_2ec_58',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]],
['fit_59',['fit',['../dd/d8c/adaline__learning_8c.html#a355fda53c238a0c0c07f03dcc021caed',1,'adaline_learning.c']]],
['fit_5fsample_60',['fit_sample',['../dd/d8c/adaline__learning_8c.html#afa953e811eaae199d121a7ddb619d604',1,'adaline_learning.c']]],
['forward_5feuler_61',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
['forward_5feuler_5fstep_62',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
['free_5fmemory_63',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
['func_64',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]]
['factorial_5flarge_5fnumber_2ec_60',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fib_61',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]],
['fibonacci_5ffast_2ec_62',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]],
['fit_63',['fit',['../dd/d8c/adaline__learning_8c.html#a355fda53c238a0c0c07f03dcc021caed',1,'adaline_learning.c']]],
['fit_5fsample_64',['fit_sample',['../dd/d8c/adaline__learning_8c.html#afa953e811eaae199d121a7ddb619d604',1,'adaline_learning.c']]],
['forward_5feuler_65',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]],
['forward_5feuler_5fstep_66',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]],
['free_5fmemory_67',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]],
['func_68',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]]
];

28
search/all_7.js
View File

@ -1,17 +1,17 @@
var searchData=
[
['gcd_65',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]],
['get_5fclock_5fdiff_66',['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_67',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
['get_5fdivisors_68',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
['get_5fmin_5f1d_69',['get_min_1d',['../d0/d46/kohonen__som__trace_8c.html#a0a292ebd954c568934b1fd06666d27e6',1,'kohonen_som_trace.c']]],
['get_5fmin_5f2d_70',['get_min_2d',['../d2/df6/kohonen__som__topology_8c.html#adc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
['get_5fmonth_5fdays_71',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
['get_5fnext_5fabundant_72',['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_73',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
['get_5fperfect_5fnumber_74',['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_75',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]],
['get_5fweights_5fstr_76',['get_weights_str',['../dd/d8c/adaline__learning_8c.html#a00dc6134ca22a12e0fd9cac54d601c2d',1,'adaline_learning.c']]],
['graph_77',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_78',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
['gcd_69',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]],
['get_5fclock_5fdiff_70',['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_71',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]],
['get_5fdivisors_72',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]],
['get_5fmin_5f1d_73',['get_min_1d',['../d0/d46/kohonen__som__trace_8c.html#a0a292ebd954c568934b1fd06666d27e6',1,'kohonen_som_trace.c']]],
['get_5fmin_5f2d_74',['get_min_2d',['../d2/df6/kohonen__som__topology_8c.html#adc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]],
['get_5fmonth_5fdays_75',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]],
['get_5fnext_5fabundant_76',['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_77',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]],
['get_5fperfect_5fnumber_78',['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_79',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]],
['get_5fweights_5fstr_80',['get_weights_str',['../dd/d8c/adaline__learning_8c.html#a00dc6134ca22a12e0fd9cac54d601c2d',1,'adaline_learning.c']]],
['graph_81',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_82',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
];

4
search/all_8.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['hash_5fset_5ft_79',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]],
['hash_20algorithms_80',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]]
['hash_5fset_5ft_83',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]],
['hash_20algorithms_84',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]]
];

18
search/all_9.js
View File

@ -1,12 +1,12 @@
var searchData=
[
['inorder_5fdisplay_81',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_5fbt_82',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['is_5fabundant_83',['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_84',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_85',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fpalindromic_86',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_87',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_88',['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_89',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]]
['inorder_5fdisplay_85',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]],
['insert_5fbt_86',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]],
['is_5fabundant_87',['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_88',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]],
['is_5fleap_5fyear_89',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]],
['is_5fpalindromic_90',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]],
['is_5fprime_91',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]],
['is_5fsum_5fof_5fabundant_92',['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_93',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]]
];

8
search/all_a.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['kohonen_5fsom_90',['kohonen_som',['../d2/df6/kohonen__som__topology_8c.html#a1983dc0f35e734015772e9f8c0ff19f5',1,'kohonen_som_topology.c']]],
['kohonen_5fsom_5ftopology_2ec_91',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_92',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]],
['kohonen_5fsom_5ftracer_93',['kohonen_som_tracer',['../d0/d46/kohonen__som__trace_8c.html#aeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]]
['kohonen_5fsom_94',['kohonen_som',['../d2/df6/kohonen__som__topology_8c.html#a1983dc0f35e734015772e9f8c0ff19f5',1,'kohonen_som_topology.c']]],
['kohonen_5fsom_5ftopology_2ec_95',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_96',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]],
['kohonen_5fsom_5ftracer_97',['kohonen_som_tracer',['../d0/d46/kohonen__som__trace_8c.html#aeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]]
];

20
search/all_b.js
View File

@ -1,13 +1,13 @@
var searchData=
[
['l_94',['L',['../df/db3/struct_l.html',1,'']]],
['large_5fnum_95',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]],
['lazy_5fsort_96',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_97',['lcm',['../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol.c']]],
['lims_98',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]],
['llink_99',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_100',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_101',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]],
['list_20of_20all_20files_102',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
['leetcode_103',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]]
['l_98',['L',['../df/db3/struct_l.html',1,'']]],
['large_5fnum_99',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]],
['lazy_5fsort_100',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]],
['lcm_101',['lcm',['../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol.c']]],
['lims_102',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]],
['llink_103',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]],
['lu_5fdecompose_2ec_104',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]],
['lu_5fdecomposition_105',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]],
['list_20of_20all_20files_106',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
['leetcode_107',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]]
];

38
search/all_c.js
View File

File diff suppressed because one or more lines are too long

22
search/all_d.js
View File

@ -1,14 +1,14 @@
var searchData=
[
['n_122',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
['n2_123',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]],
['new_5fadaline_124',['new_adaline',['../dd/d8c/adaline__learning_8c.html#acd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
['new_5fnumber_125',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
['newton_5fraphson_5froot_2ec_126',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
['next_127',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]],
['next_5fdigit_128',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
['node_129',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node():&#160;threaded_binary_trees.c']]],
['num_5fdigits_130',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
['num_5fweights_131',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
['number_5fof_5fpaths_132',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
['n_128',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
['n2_129',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]],
['new_5fadaline_130',['new_adaline',['../dd/d8c/adaline__learning_8c.html#acd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]],
['new_5fnumber_131',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]],
['newton_5fraphson_5froot_2ec_132',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]],
['next_133',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]],
['next_5fdigit_134',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]],
['node_135',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node():&#160;threaded_binary_trees.c']]],
['num_5fdigits_136',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]],
['num_5fweights_137',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]],
['number_5fof_5fpaths_138',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]]
];

8
search/all_e.js
View File

@ -1,7 +1,7 @@
var searchData=
[
['ode_5fforward_5feuler_2ec_133',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_134',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_135',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]],
['order_136',['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']]]
['ode_5fforward_5feuler_2ec_139',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_140',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_141',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]],
['order_142',['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']]]
];

24
search/all_f.js
View File

@ -1,15 +1,15 @@
var searchData=
[
['projecteuler_137',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
['pid_138',['pid',['../d0/d43/structpid.html',1,'']]],
['poly_5ffunction_139',['poly_function',['../da/d38/durand__kerner__roots_8c.html#adf4ae062a028c6faf2b96c9c1eb343af',1,'durand_kerner_roots.c']]],
['postorder_5fdisplay_140',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['predict_141',['predict',['../dd/d8c/adaline__learning_8c.html#a4db1ba00a7f282100ea31a94e32bd7a3',1,'adaline_learning.c']]],
['preorder_5fdisplay_142',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prev_5fdigit_143',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
['print_144',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'cantor_set.c']]],
['print_5fmatrix_145',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_146',['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_147',['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_148',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]]
['projecteuler_143',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
['pid_144',['pid',['../d0/d43/structpid.html',1,'']]],
['poly_5ffunction_145',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['postorder_5fdisplay_146',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['predict_147',['predict',['../dd/d8c/adaline__learning_8c.html#a4db1ba00a7f282100ea31a94e32bd7a3',1,'adaline_learning.c']]],
['preorder_5fdisplay_148',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prev_5fdigit_149',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
['print_150',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'cantor_set.c']]],
['print_5fmatrix_151',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_152',['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_153',['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_154',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]]
];

6
search/classes_0.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['_5fbig_5fint_210',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
['_5fcantor_5fset_211',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
['_5flarge_5fnum_212',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
['_5fbig_5fint_216',['_big_int',['../dc/d77/struct__big__int.html',1,'']]],
['_5fcantor_5fset_217',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]],
['_5flarge_5fnum_218',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]]
];

6
search/classes_1.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['adaline_213',['adaline',['../d2/daa/structadaline.html',1,'']]],
['array_5f3d_214',['array_3d',['../d0/dc8/structarray__3d.html',1,'']]],
['avlnode_215',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
['adaline_219',['adaline',['../d2/daa/structadaline.html',1,'']]],
['array_5f3d_220',['array_3d',['../d0/dc8/structarray__3d.html',1,'']]],
['avlnode_221',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]]
];

2
search/classes_2.js
View File

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

2
search/classes_3.js
View File

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

6
search/classes_4.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['data_218',['data',['../df/dea/structdata.html',1,'']]],
['dict_219',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dynamic_5farray_220',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
['data_224',['data',['../df/dea/structdata.html',1,'']]],
['dict_225',['Dict',['../d4/dfe/struct_dict.html',1,'']]],
['dynamic_5farray_226',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]]
];

4
search/classes_5.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['edge_221',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['elem_222',['elem',['../d0/d6b/structelem.html',1,'']]]
['edge_227',['Edge',['../d5/db4/struct_edge.html',1,'']]],
['elem_228',['elem',['../d0/d6b/structelem.html',1,'']]]
];

4
search/classes_6.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['graph_223',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_224',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
['graph_229',['Graph',['../d4/dd4/struct_graph.html',1,'']]],
['graphrep_230',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]]
];

2
search/classes_7.js
View File

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

2
search/classes_8.js
View File

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

4
search/classes_9.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['max_5fheap_227',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
['min_5fheap_228',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
['max_5fheap_233',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]],
['min_5fheap_234',['min_heap',['../de/dce/structmin__heap.html',1,'']]]
];

2
search/classes_a.js
View File

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

2
search/classes_b.js
View File

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

4
search/classes_c.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['queue_231',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_232',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
['queue_237',['queue',['../d2/d36/structqueue.html',1,'']]],
['queuerep_238',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]]
];

4
search/classes_d.js
View File

@ -1,5 +1,5 @@
var searchData=
[
['stack_233',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['subset_234',['subset',['../dc/de5/structsubset.html',1,'']]]
['stack_239',['Stack',['../dd/d10/struct_stack.html',1,'']]],
['subset_240',['subset',['../dc/de5/structsubset.html',1,'']]]
];

6
search/classes_e.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['t_235',['T',['../d5/d7e/struct_t.html',1,'']]],
['tnode_236',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_237',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
['t_241',['T',['../d5/d7e/struct_t.html',1,'']]],
['tnode_242',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['trienode_243',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]]
];

2
search/classes_f.js
View File

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

2
search/defines_0.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['_5fuse_5fmath_5fdefines_395',['_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_406',['_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_396',['ACCURACY',['../dd/d8c/adaline__learning_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;adaline_learning.c'],['../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_407',['ACCURACY',['../dd/d8c/adaline__learning_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY():&#160;adaline_learning.c'],['../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=
[
['epsilon_397',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]]
['bead_408',['BEAD',['../d2/da8/bead__sort_8c.html#a4fdb8af29a07ac8f496e49a11bf9f1bd',1,'bead_sort.c']]]
];

2
search/defines_3.js
View File

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

11
search/defines_4.js
View File

@ -1,13 +1,4 @@
var searchData=
[
['max_399',['max',['../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#affe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_trace.c']]],
['max_5fdeno_400',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_401',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
['max_5fiter_402',['MAX_ITER',['../dd/d8c/adaline__learning_8c.html#acd517c6f195c75b9dd0f3aad65326f3b',1,'adaline_learning.c']]],
['max_5fl_403',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]],
['max_5flen_404',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
['max_5fname_5flen_405',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
['max_5fnames_406',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
['min_407',['min',['../d2/df6/kohonen__som__topology_8c.html#ac6afabdc09a49a433ee19d8a9486056d',1,'min():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#ac6afabdc09a49a433ee19d8a9486056d',1,'min():&#160;kohonen_som_trace.c']]],
['mod_408',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]]
['lims_410',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]]
];

12
search/defines_5.js
View File

@ -1,5 +1,13 @@
var searchData=
[
['n_409',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
['n2_410',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]]
['max_411',['max',['../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#affe776513b24d84b39af8ab0930fef7f',1,'max():&#160;kohonen_som_trace.c']]],
['max_5fdeno_412',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]],
['max_5fdigits_413',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]],
['max_5fiter_414',['MAX_ITER',['../dd/d8c/adaline__learning_8c.html#acd517c6f195c75b9dd0f3aad65326f3b',1,'adaline_learning.c']]],
['max_5fl_415',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]],
['max_5flen_416',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]],
['max_5fname_5flen_417',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]],
['max_5fnames_418',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]],
['min_419',['min',['../d2/df6/kohonen__som__topology_8c.html#ac6afabdc09a49a433ee19d8a9486056d',1,'min():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#ac6afabdc09a49a433ee19d8a9486056d',1,'min():&#160;kohonen_som_trace.c']]],
['mod_420',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]]
];

3
search/defines_6.js
View File

@ -1,4 +1,5 @@
var searchData=
[
['order_411',['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']]]
['n_421',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]],
['n2_422',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]]
];

36
search/defines_7.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="defines_7.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/defines_7.js Normal file
View File

@ -0,0 +1,4 @@
var searchData=
[
['order_423',['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_239',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
['adaline_5flearning_2ec_245',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]]
];

3
search/files_1.js
View File

@ -1,4 +1,5 @@
var searchData=
[
['binary_5fsearch_2ec_240',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]]
['bead_5fsort_2ec_246',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]],
['binary_5fsearch_2ec_247',['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_241',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_242',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['collatz_2ec_243',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]]
['c_5fatoi_5fstr_5fto_5finteger_2ec_248',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]],
['cantor_5fset_2ec_249',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]],
['collatz_2ec_250',['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_244',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]]
['durand_5fkerner_5froots_2ec_251',['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_245',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fibonacci_5ffast_2ec_246',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]]
['factorial_5flarge_5fnumber_2ec_252',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]],
['fibonacci_5ffast_2ec_253',['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_247',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_248',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]]
['kohonen_5fsom_5ftopology_2ec_254',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]],
['kohonen_5fsom_5ftrace_2ec_255',['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_249',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
['lu_5fdecompose_2ec_256',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]]
];

2
search/files_7.js
View File

@ -1,4 +1,4 @@
var searchData=
[
['newton_5fraphson_5froot_2ec_250',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]]
['modified_5fbinary_5fsearch_2ec_257',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]]
];

4
search/files_8.js
View File

@ -1,6 +1,4 @@
var searchData=
[
['ode_5fforward_5feuler_2ec_251',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_252',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_253',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]]
['newton_5fraphson_5froot_2ec_258',['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=
[
['qr_5fdecompose_2eh_254',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_255',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_256',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]]
['ode_5fforward_5feuler_2ec_259',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]],
['ode_5fmidpoint_5feuler_2ec_260',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]],
['ode_5fsemi_5fimplicit_5feuler_2ec_261',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]]
];

4
search/files_a.js
View File

@ -1,4 +1,6 @@
var searchData=
[
['realtime_5fstats_2ec_257',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
['qr_5fdecompose_2eh_262',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
['qr_5fdecomposition_2ec_263',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]],
['qr_5feigen_5fvalues_2ec_264',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]]
];

8
search/files_b.js
View File

@ -1,10 +1,4 @@
var searchData=
[
['shell_5fsort2_2ec_258',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['so1_2ec_259',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_260',['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_261',['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_262',['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_263',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_264',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]]
['realtime_5fstats_2ec_265',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]]
];

8
search/files_c.js
View File

@ -1,4 +1,10 @@
var searchData=
[
['threaded_5fbinary_5ftrees_2ec_265',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]]
['shell_5fsort2_2ec_266',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]],
['so1_2ec_267',['so1.c',['../d0/d7f/so1_8c.html',1,'']]],
['sol_2ec_268',['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_269',['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_270',['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_271',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]],
['sol4_2ec_272',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]]
];

36
search/files_d.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="files_d.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/files_d.js Normal file
View File

@ -0,0 +1,4 @@
var searchData=
[
['threaded_5fbinary_5ftrees_2ec_273',['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_266',['_random',['../d2/df6/kohonen__som__topology_8c.html#af5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#af5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_trace.c']]]
['_5frandom_274',['_random',['../d2/df6/kohonen__som__topology_8c.html#af5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#af5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b):&#160;kohonen_som_trace.c']]]
];

6
search/functions_1.js
View File

@ -1,6 +1,6 @@
var searchData=
[
['activation_267',['activation',['../dd/d8c/adaline__learning_8c.html#a7b12b6513314c975303b5a698608322f',1,'adaline_learning.c']]],
['add_5fdigit_268',['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_269',['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']]]
['activation_275',['activation',['../dd/d8c/adaline__learning_8c.html#a7b12b6513314c975303b5a698608322f',1,'adaline_learning.c']]],
['add_5fdigit_276',['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_277',['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_340',['save_2d_data',['../d2/df6/kohonen__som__topology_8c.html#a6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_341',['save_nd_data',['../d0/d46/kohonen__som__trace_8c.html#a7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_342',['save_u_matrix',['../d2/df6/kohonen__som__topology_8c.html#adee1bc3871c881f6e04cb9e0b1d01158',1,'kohonen_som_topology.c']]],
['search_343',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_344',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_345',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_346',['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_347',['show_data',['../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_348',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_349',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['stats_5fcomputer1_350',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_351',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['sum_5fof_5fdivisors_352',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_353',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_354',['swap',['../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
['save_5f2d_5fdata_351',['save_2d_data',['../d2/df6/kohonen__som__topology_8c.html#a6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]],
['save_5fnd_5fdata_352',['save_nd_data',['../d0/d46/kohonen__som__trace_8c.html#a7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]],
['save_5fu_5fmatrix_353',['save_u_matrix',['../d2/df6/kohonen__som__topology_8c.html#adee1bc3871c881f6e04cb9e0b1d01158',1,'kohonen_som_topology.c']]],
['search_354',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]],
['semi_5fimplicit_5feuler_355',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]],
['semi_5fimplicit_5feuler_5fstep_356',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]],
['shell_5fsort_357',['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_358',['show_data',['../d6/ded/shell__sort2_8c.html#aeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]],
['sigma_359',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]],
['sigma2_360',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]],
['stats_5fcomputer1_361',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]],
['stats_5fcomputer2_362',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]],
['sum_5fof_5fdivisors_363',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]],
['sum_5fof_5fprimes_364',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]],
['swap_365',['swap',['../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8',1,'shell_sort2.c']]]
];

24
search/functions_11.js
View File

@ -1,15 +1,15 @@
var searchData=
[
['test_355',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_356',['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_357',['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_358',['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_359',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_360',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_361',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_362',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_363',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_364',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_365',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_366',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]]
['test_366',['test',['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'binary_search.c']]],
['test1_367',['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_368',['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_369',['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_370',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses_371',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]],
['test_5f3d_5fclasses1_372',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]],
['test_5f3d_5fclasses2_373',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]],
['test_5fc_5fatoi_374',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]],
['test_5fcircle_375',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]],
['test_5ffunction_376',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]],
['test_5flamniscate_377',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]]
];

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