Documentation for 5bf2c42bff

This commit is contained in:
github-actions 2023-02-20 22:49:53 +00:00
parent 18f946e7ec
commit 15c9a91d8b
38 changed files with 935 additions and 153 deletions

View File

@ -0,0 +1,453 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: sorting/patience_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 id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d2/d57/patience__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">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">patience_sort.c File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Patience_sorting" target="_blank">Patience Sort</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;assert.h&gt;</code><br />
<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 patience_sort.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d11/patience__sort_8c__incl.svg" width="254" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a5ce3f8e766a38377168ae737605745c8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8">patienceSort</a> (int *array, int length)</td></tr>
<tr class="memdesc:a5ce3f8e766a38377168ae737605745c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assertions for IO operations for memory management <br /></td></tr>
<tr class="separator:a5ce3f8e766a38377168ae737605745c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a51db6714f25747b7de0daca675363e19"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19">printArray</a> (int *array, int length)</td></tr>
<tr class="memdesc:a51db6714f25747b7de0daca675363e19"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper function to print an array. <br /></td></tr>
<tr class="separator:a51db6714f25747b7de0daca675363e19"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af0cc492037e002ba5145e2e770ed0e66"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66">testArray</a> (int *array, int length)</td></tr>
<tr class="memdesc:af0cc492037e002ba5145e2e770ed0e66"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testing Helper function. <br /></td></tr>
<tr class="separator:af0cc492037e002ba5145e2e770ed0e66"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d57/patience__sort_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://en.wikipedia.org/wiki/Patience_sorting" target="_blank">Patience Sort</a> </p>
<p>From Wikipedia: In computer science, patience sorting is a sorting algorithm inspired by, and named after, the card game patience. Given an array of n elements from some totally ordered domain, consider this array as a collection of cards and simulate the patience sorting game. When the game is over, recover the sorted sequence by repeatedly picking off the minimum visible card; in other words, perform a k-way merge of the p piles, each of which is internally sorted. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/CascadingCascade" target="_blank">CascadingCascade</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 157</span> {</div>
<div class="line"><span class="lineno"> 158</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 160</span>}</div>
<div class="ttc" id="apatience__sort_8c_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> patience_sort.c:139</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d57/patience__sort_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="419" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a5ce3f8e766a38377168ae737605745c8" name="a5ce3f8e766a38377168ae737605745c8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5ce3f8e766a38377168ae737605745c8">&#9670;&#160;</a></span>patienceSort()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void patienceSort </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>array</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>length</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>for assertions for IO operations for memory management </p>
<p>Sorts the target array by dividing it into a variable number of internally sorted piles then merge the piles </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">array</td><td>pointer to the array to be sorted </td></tr>
<tr><td class="paramname">length</td><td>length of the target array </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 22</span> {</div>
<div class="line"><span class="lineno"> 23</span> <span class="comment">// An array of pointers used to store each pile</span></div>
<div class="line"><span class="lineno"> 24</span> <span class="keywordtype">int</span>* *piles = (<span class="keywordtype">int</span>* *) <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc</a>(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>*) * length);</div>
<div class="line"><span class="lineno"> 25</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; ++i) {</div>
<div class="line"><span class="lineno"> 26</span> piles[i] = <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc</a>(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>) * length);</div>
<div class="line"><span class="lineno"> 27</span> }</div>
<div class="line"><span class="lineno"> 28</span> </div>
<div class="line"><span class="lineno"> 29</span> <span class="comment">// pileSizes keep track of the indices of each pile&#39;s topmost element, hence 0 means only one element</span></div>
<div class="line"><span class="lineno"> 30</span> <span class="comment">// Note how calloc() is used to initialize the sizes of all piles to zero</span></div>
<div class="line"><span class="lineno"> 31</span> <span class="keywordtype">int</span> *pileSizes = (<span class="keywordtype">int</span>*) <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(length,<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));</div>
<div class="line"><span class="lineno"> 32</span> </div>
<div class="line"><span class="lineno"> 33</span> <span class="comment">// This initializes the first pile, note how using an array of pointers allowed us to access elements through two subscripts</span></div>
<div class="line"><span class="lineno"> 34</span> <span class="comment">// The first subscript indicates which pile we are accessing, the second subscript indicates the location being accessed in that pile</span></div>
<div class="line"><span class="lineno"> 35</span> piles[0][0] = array[0];</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">int</span> pileCount = 1;</div>
<div class="line"><span class="lineno"> 37</span> </div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; length; ++i) {</div>
<div class="line"><span class="lineno"> 39</span> <span class="comment">// This will be used to keep track whether an element has been added to an existing pile</span></div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordtype">int</span> flag = 1;</div>
<div class="line"><span class="lineno"> 41</span> </div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; pileCount; ++j) {</div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">if</span>(piles[j][pileSizes[j]] &gt; array[i]) {</div>
<div class="line"><span class="lineno"> 44</span> <span class="comment">// We have found a pile this element can be added to</span></div>
<div class="line"><span class="lineno"> 45</span> piles[j][pileSizes[j] + 1] = array[i];</div>
<div class="line"><span class="lineno"> 46</span> pileSizes[j]++;</div>
<div class="line"><span class="lineno"> 47</span> flag--;</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 49</span> }</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> </div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">if</span>(flag) {</div>
<div class="line"><span class="lineno"> 53</span> <span class="comment">// The element in question can not be added to any existing piles, creating a new pile</span></div>
<div class="line"><span class="lineno"> 54</span> piles[pileCount][0] = array[i];</div>
<div class="line"><span class="lineno"> 55</span> pileCount++;</div>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="line"><span class="lineno"> 57</span> }</div>
<div class="line"><span class="lineno"> 58</span> </div>
<div class="line"><span class="lineno"> 59</span> <span class="comment">// This will keep track of the minimum value of all &#39;exposed&#39; elements and which pile that value is from</span></div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">int</span> min, minLocation;</div>
<div class="line"><span class="lineno"> 61</span> </div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; ++i) {</div>
<div class="line"><span class="lineno"> 63</span> <span class="comment">// Since there&#39;s no guarantee the first pile will be depleted slower than other piles,</span></div>
<div class="line"><span class="lineno"> 64</span> <span class="comment">// Example: when all elements are equal, in that case the first pile will be depleted immediately</span></div>
<div class="line"><span class="lineno"> 65</span> <span class="comment">// We can&#39;t simply initialize min to the top most element of the first pile,</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="comment">// this loop finds a value to initialize min to.</span></div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; pileCount; ++j) {</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">if</span>(pileSizes[j] &lt; 0) {</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 70</span> }</div>
<div class="line"><span class="lineno"> 71</span> min = piles[j][pileSizes[j]];</div>
<div class="line"><span class="lineno"> 72</span> minLocation = j;</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 74</span> }</div>
<div class="line"><span class="lineno"> 75</span> </div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; pileCount; ++j) {</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">if</span>(pileSizes[j] &lt; 0) {</div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 79</span> }</div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span>(piles[j][pileSizes[j]] &lt; min) {</div>
<div class="line"><span class="lineno"> 81</span> min = piles[j][pileSizes[j]];</div>
<div class="line"><span class="lineno"> 82</span> minLocation = j;</div>
<div class="line"><span class="lineno"> 83</span> }</div>
<div class="line"><span class="lineno"> 84</span> }</div>
<div class="line"><span class="lineno"> 85</span> </div>
<div class="line"><span class="lineno"> 86</span> array[i] = min;</div>
<div class="line"><span class="lineno"> 87</span> pileSizes[minLocation]--;</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> </div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// Deallocate memory</span></div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(pileSizes);</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; ++i) {</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(piles[i]);</div>
<div class="line"><span class="lineno"> 94</span> }</div>
<div class="line"><span class="lineno"> 95</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(piles);</div>
<div class="line"><span class="lineno"> 96</span>}</div>
<div class="ttc" id="amalloc__dbg_8h_html_a725f50ecaf1959d96de79b36b4788fee"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc</a></div><div class="ttdeci">#define malloc(bytes)</div><div class="ttdoc">This macro replace the standard malloc function with malloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:18</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a></div><div class="ttdeci">#define free(ptr)</div><div class="ttdoc">This macro replace the standard free function with free_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:26</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_afdddaa949a93c1ef559a638e98f9c21b"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a></div><div class="ttdeci">#define calloc(elemCount, elemSize)</div><div class="ttdoc">This macro replace the standard calloc function with calloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:22</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a51db6714f25747b7de0daca675363e19" name="a51db6714f25747b7de0daca675363e19"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a51db6714f25747b7de0daca675363e19">&#9670;&#160;</a></span>printArray()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void printArray </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>array</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>length</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Helper function to print an array. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">array</td><td>pointer to the array </td></tr>
<tr><td class="paramname">length</td><td>length of the target array </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 104</span> {</div>
<div class="line"><span class="lineno"> 105</span> printf(<span class="stringliteral">&quot;Array:&quot;</span>);</div>
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; ++i) {</div>
<div class="line"><span class="lineno"> 107</span> printf(<span class="stringliteral">&quot;%d&quot;</span>,array[i]);</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (i != length - 1) putchar(<span class="charliteral">&#39;,&#39;</span>);</div>
<div class="line"><span class="lineno"> 109</span> }</div>
<div class="line"><span class="lineno"> 110</span> putchar(<span class="charliteral">&#39;\n&#39;</span>);</div>
<div class="line"><span class="lineno"> 111</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordtype">int</span> testArray1[] = {2,8,7,1,3,5,6,4};</div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordtype">int</span> testArray2[] = {2,2,5,1,3,5,6,4};</div>
<div class="line"><span class="lineno"> 142</span> <span class="keywordtype">int</span> testArray3[] = {1,2,3,4,5,6,7,8};</div>
<div class="line"><span class="lineno"> 143</span> <span class="keywordtype">int</span> testArray4[] = {8,7,6,5,4,3,2,1};</div>
<div class="line"><span class="lineno"> 144</span> </div>
<div class="line"><span class="lineno"> 145</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66">testArray</a>(testArray1,8);</div>
<div class="line"><span class="lineno"> 146</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66">testArray</a>(testArray2,8);</div>
<div class="line"><span class="lineno"> 147</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66">testArray</a>(testArray3,8);</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66">testArray</a>(testArray4,8);</div>
<div class="line"><span class="lineno"> 149</span> </div>
<div class="line"><span class="lineno"> 150</span> printf(<span class="stringliteral">&quot;Testing successfully completed!\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 151</span>}</div>
<div class="ttc" id="apatience__sort_8c_html_af0cc492037e002ba5145e2e770ed0e66"><div class="ttname"><a href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66">testArray</a></div><div class="ttdeci">void testArray(int *array, int length)</div><div class="ttdoc">Testing Helper function.</div><div class="ttdef"><b>Definition:</b> patience_sort.c:120</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d57/patience__sort_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="320" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="af0cc492037e002ba5145e2e770ed0e66" name="af0cc492037e002ba5145e2e770ed0e66"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af0cc492037e002ba5145e2e770ed0e66">&#9670;&#160;</a></span>testArray()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void testArray </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>array</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>length</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Testing Helper function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">array</td><td>pointer to the array to be used for testing </td></tr>
<tr><td class="paramname">length</td><td>length of the target array </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 120</span> {</div>
<div class="line"><span class="lineno"> 121</span> printf(<span class="stringliteral">&quot;Before sorting:\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19">printArray</a>(array,length);</div>
<div class="line"><span class="lineno"> 123</span> </div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8">patienceSort</a>(array,length);</div>
<div class="line"><span class="lineno"> 125</span> </div>
<div class="line"><span class="lineno"> 126</span> printf(<span class="stringliteral">&quot;After sorting:\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 127</span> <a class="code hl_function" href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19">printArray</a>(array,length);</div>
<div class="line"><span class="lineno"> 128</span> </div>
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length - 1; ++i) {</div>
<div class="line"><span class="lineno"> 130</span> assert(array[i] &lt;= array[i + 1]);</div>
<div class="line"><span class="lineno"> 131</span> }</div>
<div class="line"><span class="lineno"> 132</span> printf(<span class="stringliteral">&quot;All assertions have passed!\n\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 133</span>}</div>
<div class="ttc" id="apatience__sort_8c_html_a51db6714f25747b7de0daca675363e19"><div class="ttname"><a href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19">printArray</a></div><div class="ttdeci">void printArray(int *array, int length)</div><div class="ttdoc">Helper function to print an array.</div><div class="ttdef"><b>Definition:</b> patience_sort.c:104</div></div>
<div class="ttc" id="apatience__sort_8c_html_a5ce3f8e766a38377168ae737605745c8"><div class="ttname"><a href="../../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8">patienceSort</a></div><div class="ttdeci">void patienceSort(int *array, int length)</div><div class="ttdoc">for assertions for IO operations for memory management</div><div class="ttdef"><b>Definition:</b> patience_sort.c:22</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d57/patience__sort_8c_af0cc492037e002ba5145e2e770ed0e66_cgraph.svg" width="228" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d2/d57/patience__sort_8c.html">patience_sort.c</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
</ul>
</div>
</body>
</html>

View File

@ -0,0 +1,8 @@
var patience__sort_8c =
[
[ "main", "d2/d57/patience__sort_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "patienceSort", "d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8", null ],
[ "printArray", "d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19", null ],
[ "test", "d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d", null ],
[ "testArray", "d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66", null ]
];

View File

@ -0,0 +1,6 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
<area shape="rect" id="node2" href="$d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66" title="Testing Helper function." alt="" coords="97,31,172,56"/>
<area shape="rect" id="node3" href="$d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8" title="for assertions for IO operations for memory management" alt="" coords="220,5,315,31"/>
<area shape="rect" id="node4" href="$d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19" title="Helper function to print an array." alt="" coords="228,55,307,80"/>
</map>

View File

@ -0,0 +1 @@
5b8e810640a93574216ead163fcf27a3

View File

@ -0,0 +1,66 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: test Pages: 1 -->
<svg width="240pt" height="64pt"
viewBox="0.00 0.00 240.00 64.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="33,-37 0,-37 0,-18 33,-18 33,-37"/>
<text text-anchor="middle" x="16.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66" target="_top" xlink:title="Testing Helper function.">
<polygon fill="white" stroke="#666666" points="125,-37 69,-37 69,-18 125,-18 125,-37"/>
<text text-anchor="middle" x="97" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">testArray</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M33.39,-27.5C40.35,-27.5 48.85,-27.5 57.32,-27.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.18,-31 67.18,-27.5 57.18,-24 57.18,-31"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8" target="_top" xlink:title="for assertions for IO operations for memory management">
<polygon fill="white" stroke="#666666" points="232,-56 161,-56 161,-37 232,-37 232,-56"/>
<text text-anchor="middle" x="196.5" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">patienceSort</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M125.42,-32.84C132.93,-34.31 141.28,-35.94 149.53,-37.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.65,-40.94 159.14,-39.41 149.99,-34.07 148.65,-40.94"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19" target="_top" xlink:title="Helper function to print an array.">
<polygon fill="white" stroke="#666666" points="226,-19 167,-19 167,0 226,0 226,-19"/>
<text text-anchor="middle" x="196.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M125.42,-22.44C134.75,-20.72 145.38,-18.75 155.49,-16.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.9,-20.37 165.1,-15.11 154.63,-13.49 155.9,-20.37"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 3.0 KiB

View File

@ -0,0 +1,7 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,31,56,56"/>
<area shape="rect" id="node2" href="$d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,31,148,56"/>
<area shape="rect" id="node3" href="$d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66" title="Testing Helper function." alt="" coords="196,31,271,56"/>
<area shape="rect" id="node4" href="$d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8" title="for assertions for IO operations for memory management" alt="" coords="319,5,413,31"/>
<area shape="rect" id="node5" href="$d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19" title="Helper function to print an array." alt="" coords="327,55,405,80"/>
</map>

View File

@ -0,0 +1 @@
dd40d0d5bc28325b41868385d9ccd6c6

View File

@ -0,0 +1,81 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: main Pages: 1 -->
<svg width="314pt" height="64pt"
viewBox="0.00 0.00 314.00 64.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="38,-37 0,-37 0,-18 38,-18 38,-37"/>
<text text-anchor="middle" x="19" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="107,-37 74,-37 74,-18 107,-18 107,-37"/>
<text text-anchor="middle" x="90.5" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M38.26,-27.5C45.72,-27.5 54.5,-27.5 62.66,-27.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.44,-31 72.44,-27.5 62.44,-24 62.44,-31"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66" target="_top" xlink:title="Testing Helper function.">
<polygon fill="white" stroke="#666666" points="199,-37 143,-37 143,-18 199,-18 199,-37"/>
<text text-anchor="middle" x="171" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">testArray</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M107.39,-27.5C114.35,-27.5 122.85,-27.5 131.32,-27.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.18,-31 141.18,-27.5 131.18,-24 131.18,-31"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8" target="_top" xlink:title="for assertions for IO operations for memory management">
<polygon fill="white" stroke="#666666" points="306,-56 235,-56 235,-37 306,-37 306,-56"/>
<text text-anchor="middle" x="270.5" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">patienceSort</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M199.42,-32.84C206.93,-34.31 215.28,-35.94 223.53,-37.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="222.65,-40.94 233.14,-39.41 223.99,-34.07 222.65,-40.94"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19" target="_top" xlink:title="Helper function to print an array.">
<polygon fill="white" stroke="#666666" points="300,-19 241,-19 241,0 300,0 300,-19"/>
<text text-anchor="middle" x="270.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node5</title>
<path fill="none" stroke="#63b8ff" d="M199.42,-22.44C208.75,-20.72 219.38,-18.75 229.49,-16.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.9,-20.37 239.1,-15.11 228.63,-13.49 229.9,-20.37"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 3.7 KiB

View File

@ -0,0 +1,5 @@
<map id="testArray" name="testArray">
<area shape="rect" id="node1" title="Testing Helper function." alt="" coords="5,31,80,56"/>
<area shape="rect" id="node2" href="$d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8" title="for assertions for IO operations for memory management" alt="" coords="128,5,223,31"/>
<area shape="rect" id="node3" href="$d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19" title="Helper function to print an array." alt="" coords="136,55,215,80"/>
</map>

View File

@ -0,0 +1 @@
49a5b182b42aaa3ee1b5d8191d1c1669

View File

@ -0,0 +1,51 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: testArray Pages: 1 -->
<svg width="171pt" height="64pt"
viewBox="0.00 0.00 171.00 64.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60)">
<title>testArray</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Testing Helper function.">
<polygon fill="#999999" stroke="#666666" points="56,-37 0,-37 0,-18 56,-18 56,-37"/>
<text text-anchor="middle" x="28" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">testArray</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8" target="_top" xlink:title="for assertions for IO operations for memory management">
<polygon fill="white" stroke="#666666" points="163,-56 92,-56 92,-37 163,-37 163,-56"/>
<text text-anchor="middle" x="127.5" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">patienceSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M56.42,-32.84C63.93,-34.31 72.28,-35.94 80.53,-37.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.65,-40.94 90.14,-39.41 80.99,-34.07 79.65,-40.94"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19" target="_top" xlink:title="Helper function to print an array.">
<polygon fill="white" stroke="#666666" points="157,-19 98,-19 98,0 157,0 157,-19"/>
<text text-anchor="middle" x="127.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M56.42,-22.44C65.75,-20.72 76.38,-18.75 86.49,-16.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.9,-20.37 96.1,-15.11 85.63,-13.49 86.9,-20.37"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 2.3 KiB

View File

@ -432,6 +432,7 @@ Leetcode</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/520.c" target="_blank">520</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/53.c" target="_blank">53</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/561.c" target="_blank">561</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/567.c" target="_blank">567</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/6.c" target="_blank">6</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/617.c" target="_blank">617</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/62.c" target="_blank">62</a></li>
@ -463,8 +464,10 @@ Leetcode</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/931.c" target="_blank">931</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/938.c" target="_blank">938</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/94.c" target="_blank">94</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/953.c" target="_blank">953</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/965.c" target="_blank">965</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/977.c" target="_blank">977</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/979.c" target="_blank">979</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/98.c" target="_blank">98</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/985.c" target="_blank">985</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/997.c" target="_blank">997</a></li>
@ -703,6 +706,7 @@ Sorting</h1>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/odd_even_sort.c" target="_blank">Odd Even Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/pancake_sort.c" target="_blank">Pancake Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/partition_sort.c" target="_blank">Partition Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/patience_sort.c" target="_blank">Patience Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/pigeonhole_sort.c" target="_blank">Pigeonhole Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/quick_sort.c" target="_blank">Quick Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C/blob/HEAD/sorting/radix_sort.c" target="_blank">Radix Sort</a></li>

View File

@ -0,0 +1,6 @@
<map id="sorting/patience_sort.c" name="sorting/patience_sort.c">
<area shape="rect" id="node1" title="Patience Sort" alt="" coords="52,5,207,31"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,79,75,104"/>
<area shape="rect" id="node3" title=" " alt="" coords="99,79,160,104"/>
<area shape="rect" id="node4" title=" " alt="" coords="184,79,248,104"/>
</map>

View File

@ -0,0 +1 @@
e944d7acc0627b30b6314098fbead90f

View File

@ -0,0 +1,66 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 7.1.0 (20230121.1956)
-->
<!-- Title: sorting/patience_sort.c Pages: 1 -->
<svg width="190pt" height="82pt"
viewBox="0.00 0.00 190.00 82.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 78)">
<title>sorting/patience_sort.c</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Patience Sort">
<polygon fill="#999999" stroke="#666666" points="151,-74 35,-74 35,-55 151,-55 151,-74"/>
<text text-anchor="middle" x="93" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">sorting/patience_sort.c</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="52,-19 0,-19 0,0 52,0 52,-19"/>
<text text-anchor="middle" x="26" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">assert.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M81.63,-54.51C71.95,-46.85 57.8,-35.66 46.19,-26.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="48.4,-23.76 38.38,-20.3 44.06,-29.25 48.4,-23.76"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="116,-19 70,-19 70,0 116,0 116,-19"/>
<text text-anchor="middle" x="93" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M93,-54.75C93,-48.27 93,-39.16 93,-30.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.5,-30.96 93,-20.96 89.5,-30.96 96.5,-30.96"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="182,-19 134,-19 134,0 182,0 182,-19"/>
<text text-anchor="middle" x="158" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">stdlib.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M104.03,-54.51C113.42,-46.85 127.15,-35.66 138.41,-26.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.43,-29.35 145.96,-20.31 136,-23.92 140.43,-29.35"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 2.6 KiB

View File

@ -130,6 +130,9 @@ Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d94/odd__even__sort_8c.html">odd_even_sort.c</a></td></tr>
<tr class="memdesc:d1/d94/odd__even__sort_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort" target="_blank">Odd Even Sort</a> implementation <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d57/patience__sort_8c.html">patience_sort.c</a></td></tr>
<tr class="memdesc:d2/d57/patience__sort_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Patience_sorting" target="_blank">Patience Sort</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d83/selection__sort_8c.html">selection_sort.c</a></td></tr>
<tr class="memdesc:df/d83/selection__sort_8c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> algorithm implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

View File

@ -9,6 +9,7 @@ var dir_bb1b521853a9c46347182a9d10420771 =
[ "insertion_sort_recursive.c", "de/d0c/insertion__sort__recursive_8c.html", "de/d0c/insertion__sort__recursive_8c" ],
[ "merge_sort.c", "d2/d83/merge__sort_8c.html", "d2/d83/merge__sort_8c" ],
[ "odd_even_sort.c", "d1/d94/odd__even__sort_8c.html", "d1/d94/odd__even__sort_8c" ],
[ "patience_sort.c", "d2/d57/patience__sort_8c.html", "d2/d57/patience__sort_8c" ],
[ "selection_sort.c", "df/d83/selection__sort_8c.html", "df/d83/selection__sort_8c" ],
[ "selection_sort_recursive.c", "dc/d39/selection__sort__recursive_8c.html", "dc/d39/selection__sort__recursive_8c" ],
[ "shell_sort2.c", "d6/ded/shell__sort2_8c.html", "d6/ded/shell__sort2_8c" ]

View File

@ -305,9 +305,10 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_20_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d0c/insertion__sort__recursive_8c.html" target="_self">insertion_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion sort</a> algorithm implementation </td></tr>
<tr id="row_20_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d83/merge__sort_8c.html" target="_self">merge_sort.c</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">merge sort</a> algorithm </td></tr>
<tr id="row_20_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d94/odd__even__sort_8c.html" target="_self">odd_even_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort" target="_blank">Odd Even Sort</a> implementation </td></tr>
<tr id="row_20_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d83/selection__sort_8c.html" target="_self">selection_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> algorithm implementation </td></tr>
<tr id="row_20_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d39/selection__sort__recursive_8c.html" target="_self">selection_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection Sort</a> implementation using recursion </td></tr>
<tr id="row_20_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort algorithm</a> implementation </td></tr>
<tr id="row_20_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d57/patience__sort_8c.html" target="_self">patience_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Patience_sorting" target="_blank">Patience Sort</a> </td></tr>
<tr id="row_20_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d83/selection__sort_8c.html" target="_self">selection_sort.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> algorithm implementation </td></tr>
<tr id="row_20_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d39/selection__sort__recursive_8c.html" target="_self">selection_sort_recursive.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection Sort</a> implementation using recursion </td></tr>
<tr id="row_20_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/ded/shell__sort2_8c.html" target="_self">shell_sort2.c</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort algorithm</a> implementation </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

View File

@ -144,8 +144,8 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
<li>malloc&#160;:&#160;<a class="el" href="d2/ddd/malloc__dbg_8h.html#a725f50ecaf1959d96de79b36b4788fee">malloc_dbg.h</a></li>
<li>max&#160;:&#160;<a class="el" href="d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>, <a class="el" href="d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a></li>
<li>MAX&#160;:&#160;<a class="el" href="dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326">client.c</a>, <a class="el" href="d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326">server.c</a>, <a class="el" href="d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326">prim.c</a>, <a class="el" href="d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326">bubble_sort_2.c</a></li>
<li>max&#160;:&#160;<a class="el" href="d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_topology.c</a>, <a class="el" href="d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">kohonen_som_trace.c</a></li>
<li>MAX_ADALINE_ITER&#160;:&#160;<a class="el" href="da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f">adaline_learning.c</a></li>
<li>MAX_DENO&#160;:&#160;<a class="el" href="d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">sol1.c</a></li>
<li>MAX_DIGITS&#160;:&#160;<a class="el" href="d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">sol1.c</a></li>

File diff suppressed because one or more lines are too long

View File

@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_p.html',''); initResizabl
&#160;
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
<li>patienceSort()&#160;:&#160;<a class="el" href="d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8">patience_sort.c</a></li>
<li>poly_add()&#160;:&#160;<a class="el" href="d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af">poly_add.c</a></li>
<li>poly_function()&#160;:&#160;<a class="el" href="da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">durand_kerner_roots.c</a></li>
<li>pop()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#a940cdcd27c40699eebb4ef113b2d9451">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a312e7f6c761a199c1369fbe651e084f0">infix_to_postfix2.c</a>, <a class="el" href="df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d">postfix_evaluation.c</a></li>
@ -116,6 +117,7 @@ $(document).ready(function(){initNavTree('globals_func_p.html',''); initResizabl
<li>print_number()&#160;:&#160;<a class="el" href="db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">sol1.c</a></li>
<li>print_string()&#160;:&#160;<a class="el" href="d9/deb/min__printf_8h.html#af569209570eca8bc6770fb7d9dc873e6">min_printf.h</a></li>
<li>print_vector()&#160;:&#160;<a class="el" href="de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af">vectors_3d.c</a></li>
<li>printArray()&#160;:&#160;<a class="el" href="d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19">patience_sort.c</a></li>
<li>printEPS()&#160;:&#160;<a class="el" href="d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a">k_means_clustering.c</a></li>
<li>printLeaks()&#160;:&#160;<a class="el" href="db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797">malloc_dbg.c</a>, <a class="el" href="d2/ddd/malloc__dbg_8h.html#abfd0a4452069af4cfefe4a5d037e92ef">malloc_dbg.h</a></li>
<li>printMessage()&#160;:&#160;<a class="el" href="db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef">naval_battle.c</a></li>

View File

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

File diff suppressed because one or more lines are too long

View File

@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('globals_p.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_p" name="index_p"></a>- p -</h3><ul>
<li>patienceSort()&#160;:&#160;<a class="el" href="d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8">patience_sort.c</a></li>
<li>poly_add()&#160;:&#160;<a class="el" href="d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af">poly_add.c</a></li>
<li>poly_function()&#160;:&#160;<a class="el" href="da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">durand_kerner_roots.c</a></li>
<li>pop()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#a940cdcd27c40699eebb4ef113b2d9451">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a312e7f6c761a199c1369fbe651e084f0">infix_to_postfix2.c</a>, <a class="el" href="df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d">postfix_evaluation.c</a></li>
@ -117,6 +118,7 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
<li>print_number()&#160;:&#160;<a class="el" href="db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">sol1.c</a></li>
<li>print_string()&#160;:&#160;<a class="el" href="d9/deb/min__printf_8h.html#af569209570eca8bc6770fb7d9dc873e6">min_printf.h</a></li>
<li>print_vector()&#160;:&#160;<a class="el" href="de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af">vectors_3d.c</a></li>
<li>printArray()&#160;:&#160;<a class="el" href="d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19">patience_sort.c</a></li>
<li>printEPS()&#160;:&#160;<a class="el" href="d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a">k_means_clustering.c</a></li>
<li>printLeaks()&#160;:&#160;<a class="el" href="db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797">malloc_dbg.c</a>, <a class="el" href="d2/ddd/malloc__dbg_8h.html#abfd0a4452069af4cfefe4a5d037e92ef">malloc_dbg.h</a></li>
<li>printMessage()&#160;:&#160;<a class="el" href="db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef">naval_battle.c</a></li>

View File

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

View File

@ -135,10 +135,10 @@ var NAVTREE =
var NAVTREEINDEX =
[
"annotated.html",
"d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212",
"d8/d1e/matrix__chain__order_8c.html#aa8dca7b867074164d5f45b0f3851269d",
"dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089",
"dir_f75ccd45e00436eafed446b9b2682984.html"
"d4/d68/qr__decompose_8h.html",
"d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d",
"dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b",
"dir_d9e100c82ada2163abea49688a71e81c.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

View File

@ -135,6 +135,12 @@ var NAVTREEINDEX0 =
"d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe":[16,0,18,14,0,1],
"d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83":[16,0,18,14,0,2],
"d2/d36/structqueue.html":[15,0,33],
"d2/d57/patience__sort_8c.html":[16,0,20,9],
"d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19":[16,0,20,9,2],
"d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8":[16,0,20,9,1],
"d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,9,3],
"d2/d57/patience__sort_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,9,0],
"d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66":[16,0,20,9,4],
"d2/d6a/struct_graph_rep.html":[15,0,17],
"d2/d6d/bubble__sort__2_8c.html":[16,0,20,2],
"d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326":[16,0,20,2,0],
@ -243,11 +249,5 @@ var NAVTREEINDEX0 =
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md6":[1,5],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md7":[1,5,0],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md8":[1,5,1],
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md9":[1,5,2],
"d4/d68/qr__decompose_8h.html":[16,0,16,6],
"d4/d68/qr__decompose_8h.html#a2ed4977f38642dca8b10c16a823c740b":[16,0,16,6,4],
"d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05":[16,0,16,6,2],
"d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56":[16,0,16,6,1],
"d4/d68/qr__decompose_8h.html#a5ee39e7c8fce8a604dcf7009ce101c02":[16,0,16,6,5],
"d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a":[16,0,16,6,0]
"d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md9":[1,5,2]
};

View File

@ -1,5 +1,11 @@
var NAVTREEINDEX1 =
{
"d4/d68/qr__decompose_8h.html":[16,0,16,6],
"d4/d68/qr__decompose_8h.html#a2ed4977f38642dca8b10c16a823c740b":[16,0,16,6,4],
"d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05":[16,0,16,6,2],
"d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56":[16,0,16,6,1],
"d4/d68/qr__decompose_8h.html#a5ee39e7c8fce8a604dcf7009ce101c02":[16,0,16,6,5],
"d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a":[16,0,16,6,0],
"d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212":[16,0,16,6,3],
"d4/d68/qr__decompose_8h_source.html":[16,0,16,6],
"d4/d69/group__dual__quats.html":[14,0,3],
@ -192,8 +198,8 @@ var NAVTREEINDEX1 =
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,1],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,2],
"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,4,3],
"d6/ded/shell__sort2_8c.html":[16,0,20,11],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,20,11,0],
"d6/ded/shell__sort2_8c.html":[16,0,20,12],
"d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,20,12,0],
"d6/df3/graph_8h_source.html":[16,0,3,4,0],
"d7/d0c/hash__sdbm_8c.html":[14,1,3],
"d7/d1f/problem__12_2sol1_8c.html":[16,0,18,2,0],
@ -243,11 +249,5 @@ var NAVTREEINDEX1 =
"d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17":[16,0,18,12,0,2],
"d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[16,0,18,12,0,0],
"d7/de0/stack_8h_source.html":[16,0,3,9,1],
"d7/dfd/structdual__quat__.html":[14,0,3,0],
"d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d":[14,0,3,0,0],
"d7/dfd/structdual__quat__.html#ad663036ace6a586f90a2f89386f7731a":[14,0,3,0,1],
"d8/d10/structlist.html":[15,0,21],
"d8/d10/structlist.html#a2054c799f7580787a500df82d14ace25":[15,0,21,0],
"d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41":[15,0,21,1],
"d8/d1e/matrix__chain__order_8c.html":[16,0,5,1]
"d7/dfd/structdual__quat__.html":[14,0,3,0]
};

View File

@ -1,5 +1,11 @@
var NAVTREEINDEX2 =
{
"d7/dfd/structdual__quat__.html#a1b05fbc4135e4f9b731423f26527543d":[14,0,3,0,0],
"d7/dfd/structdual__quat__.html#ad663036ace6a586f90a2f89386f7731a":[14,0,3,0,1],
"d8/d10/structlist.html":[15,0,21],
"d8/d10/structlist.html#a2054c799f7580787a500df82d14ace25":[15,0,21,0],
"d8/d10/structlist.html#a5363bdc0495ab9ef0ed587c99b9a2b41":[15,0,21,1],
"d8/d1e/matrix__chain__order_8c.html":[16,0,5,1],
"d8/d1e/matrix__chain__order_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,5,1,3],
"d8/d1e/matrix__chain__order_8c.html#ab49bc6e377a4b72a1295a953bc2520f5":[16,0,5,1,2],
"d8/d1e/matrix__chain__order_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,5,1,0],
@ -224,12 +230,12 @@ var NAVTREEINDEX2 =
"dc/d32/problem__5_2sol1_8c.html":[16,0,18,18,0],
"dc/d32/problem__5_2sol1_8c.html#a24b470eef1ce1da4401c03ae250f93e3":[16,0,18,18,0,0],
"dc/d32/problem__5_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,18,18,0,1],
"dc/d39/selection__sort__recursive_8c.html":[16,0,20,10],
"dc/d39/selection__sort__recursive_8c.html#a3f04d850b94a34dcaaed0e7bc7475241":[16,0,20,10,2],
"dc/d39/selection__sort__recursive_8c.html#aa2bc8bdd2e8ce289a6b8ef528fd1a534":[16,0,20,10,0],
"dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,10,4],
"dc/d39/selection__sort__recursive_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,20,10,3],
"dc/d39/selection__sort__recursive_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,10,1],
"dc/d39/selection__sort__recursive_8c.html":[16,0,20,11],
"dc/d39/selection__sort__recursive_8c.html#a3f04d850b94a34dcaaed0e7bc7475241":[16,0,20,11,2],
"dc/d39/selection__sort__recursive_8c.html#aa2bc8bdd2e8ce289a6b8ef528fd1a534":[16,0,20,11,0],
"dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,11,4],
"dc/d39/selection__sort__recursive_8c.html#aaf68497ab808b560dbf109da6435905a":[16,0,20,11,3],
"dc/d39/selection__sort__recursive_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,20,11,1],
"dc/d47/realtime__stats_8c.html":[16,0,16,9],
"dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96":[16,0,16,9,2],
"dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[16,0,16,9,0],
@ -243,11 +249,5 @@ var NAVTREEINDEX2 =
"dc/d64/md__coding_guidelines.html#autotoc_md16":[2,1],
"dc/d77/struct__big__int.html":[15,0,0],
"dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564":[15,0,0,0],
"dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008":[15,0,0,2],
"dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b":[15,0,0,1],
"dc/d80/cantor__set_8c.html":[16,0,14,0],
"dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97":[16,0,14,0,5],
"dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94":[16,0,14,0,1],
"dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab":[16,0,14,0,4],
"dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d":[16,0,14,0,2]
"dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008":[15,0,0,2]
};

View File

@ -1,5 +1,11 @@
var NAVTREEINDEX3 =
{
"dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b":[15,0,0,1],
"dc/d80/cantor__set_8c.html":[16,0,14,0],
"dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97":[16,0,14,0,5],
"dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94":[16,0,14,0,1],
"dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab":[16,0,14,0,4],
"dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d":[16,0,14,0,2],
"dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089":[16,0,14,0,3],
"dc/d80/collatz_8c.html":[16,0,14,2],
"dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,14,2,0],
@ -159,11 +165,11 @@ var NAVTREEINDEX3 =
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,1],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md75":[11,1,0],
"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md76":[11,2],
"df/d83/selection__sort_8c.html":[16,0,20,9],
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,9,3],
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,20,9,0],
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,20,9,2],
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[16,0,20,9,1],
"df/d83/selection__sort_8c.html":[16,0,20,10],
"df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,20,10,3],
"df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,20,10,0],
"df/d83/selection__sort_8c.html#ad126fa7239be97373c96861adc70b1d3":[16,0,20,10,2],
"df/d83/selection__sort_8c.html#aeafe7419cfceaeccaf49f22842d9a617":[16,0,20,10,1],
"df/d86/structterm.html":[15,0,42],
"df/d86/structterm.html#a057f161d279d856d11786aa96fc87f74":[15,0,42,2],
"df/d86/structterm.html#a5a730814391f70179da78c657e6e6f7b":[15,0,42,0],
@ -243,11 +249,5 @@ var NAVTREEINDEX3 =
"dir_c7ef0fcb2f2095a74f0a3a1634dfc798.html":[16,0,3,0],
"dir_d20ad0b8de644c123692ba5582cc7a7b.html":[16,0,1],
"dir_d4c35186c199e728d69dee6bf5b2473c.html":[16,0,18,22],
"dir_d9112ab06cf4d4e5a25d385a268d1949.html":[16,0,18,2],
"dir_d9e100c82ada2163abea49688a71e81c.html":[16,0,18,10],
"dir_da574daf9ce9c05b45556bdc871ed1e3.html":[16,0,19],
"dir_e3380d2178455503f266746fb14246a5.html":[16,0,8],
"dir_e39df94f82619fa5256f1786519937be.html":[16,0,3,1],
"dir_e79632891301b850df87e9c0030293fa.html":[16,0,9],
"dir_eeeea13e3a5e5edad3499183767ce312.html":[16,0,18,8]
"dir_d9112ab06cf4d4e5a25d385a268d1949.html":[16,0,18,2]
};

View File

@ -1,5 +1,11 @@
var NAVTREEINDEX4 =
{
"dir_d9e100c82ada2163abea49688a71e81c.html":[16,0,18,10],
"dir_da574daf9ce9c05b45556bdc871ed1e3.html":[16,0,19],
"dir_e3380d2178455503f266746fb14246a5.html":[16,0,8],
"dir_e39df94f82619fa5256f1786519937be.html":[16,0,3,1],
"dir_e79632891301b850df87e9c0030293fa.html":[16,0,9],
"dir_eeeea13e3a5e5edad3499183767ce312.html":[16,0,18,8],
"dir_f75ccd45e00436eafed446b9b2682984.html":[16,0,18,12],
"dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html":[16,0,18,3],
"dir_fb09f588f9daea69f78b63a0310e98cc.html":[16,0,3,8],
@ -7,8 +13,8 @@ var NAVTREEINDEX4 =
"files.html":[16,0],
"functions.html":[15,2,0],
"functions_vars.html":[15,2,1],
"globals.html":[16,1,0],
"globals.html":[16,1,0,0],
"globals.html":[16,1,0],
"globals_a.html":[16,1,0,1],
"globals_b.html":[16,1,0,2],
"globals_c.html":[16,1,0,3],
@ -16,8 +22,8 @@ var NAVTREEINDEX4 =
"globals_defs.html":[16,1,4],
"globals_e.html":[16,1,0,5],
"globals_f.html":[16,1,0,6],
"globals_func.html":[16,1,1],
"globals_func.html":[16,1,1,0],
"globals_func.html":[16,1,1],
"globals_func_a.html":[16,1,1,1],
"globals_func_b.html":[16,1,1,2],
"globals_func_c.html":[16,1,1,3],

View File

@ -1,48 +1,51 @@
var searchData=
[
['palindrome_2ec_0',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]],
['pid_1',['pid',['../d0/d43/structpid.html',1,'']]],
['pitch_2',['pitch',['../d2/de8/structeuler__.html#aa71f9aa6dfa32d8014b2d54ab8410e0b',1,'euler_']]],
['poly_5fadd_3',['poly_add',['../d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af',1,'poly_add.c']]],
['poly_5fadd_2ec_4',['poly_add.c',['../d0/dcb/poly__add_8c.html',1,'']]],
['poly_5ffunction_5',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['pop_6',['pop',['../db/d0c/infix__to__postfix_8c.html#a940cdcd27c40699eebb4ef113b2d9451',1,'pop(struct Stack *p):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a312e7f6c761a199c1369fbe651e084f0',1,'pop():&#160;infix_to_postfix2.c'],['../df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d',1,'pop():&#160;postfix_evaluation.c']]],
['port_7',['PORT',['../d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_server.c'],['../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;client.c'],['../d9/ddd/remote__command__exec__udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;remote_command_exec_udp_client.c'],['../dd/d79/remote__command__exec__udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;remote_command_exec_udp_server.c'],['../d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;server.c'],['../d1/d98/tcp__full__duplex__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_full_duplex_client.c'],['../d1/d6b/tcp__full__duplex__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_full_duplex_server.c'],['../da/d07/tcp__half__duplex__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_half_duplex_client.c'],['../d6/d2b/tcp__half__duplex__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_half_duplex_server.c'],['../da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_client.c']]],
['positionboat_8',['positionBoat',['../db/de2/naval__battle_8c.html#a3f7d3dc5931fba6164e73057859094d9',1,'naval_battle.c']]],
['postfix_5fevaluation_2ec_9',['postfix_evaluation.c',['../df/d43/postfix__evaluation_8c.html',1,'']]],
['postorder_5fdisplay_10',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['pow_11',['pow',['../df/d86/structterm.html#a057f161d279d856d11786aa96fc87f74',1,'term']]],
['power_5fof_5ften_12',['power_of_ten',['../d9/deb/min__printf_8h.html#a8421f89b76edcf21292c5100bfca586b',1,'min_printf.h']]],
['preorder_5fdisplay_13',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prev_14',['prev',['../d8/d10/structlist.html#a2054c799f7580787a500df82d14ace25',1,'list']]],
['prev_5fdigit_15',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
['previous_16',['previous',['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1cec46413acf776e3ee2b0b9241490c3',1,'MEMORY_INFORMATION']]],
['prim_17',['prim',['../d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853',1,'prim.c']]],
['prim_2ec_18',['prim.c',['../d9/dcc/prim_8c.html',1,'']]],
['prime_19',['prime',['../d1/ded/group__misc.html#gac1a7a8e00eeb590511465c28fae16e54',1,'prime_sieve.c']]],
['prime_2ec_20',['prime.c',['../da/d93/prime_8c.html',1,'']]],
['prime_5fsieve_2ec_21',['prime_sieve.c',['../dd/dd3/prime__sieve_8c.html',1,'']]],
['print_22',['print',['../dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0',1,'print(List *list):&#160;doubly_linked_list.c'],['../df/dfa/vector_8c.html#abdb067a98f90bcd9b0aa4ceb364d607f',1,'print(Vector *vec):&#160;vector.c'],['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head):&#160;cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a):&#160;sudoku_solver.c']]],
['print_5fdouble_5fvalue_23',['print_double_value',['../d9/deb/min__printf_8h.html#a4d63203d920bebd6a96f5f4aeccb21e5',1,'min_printf.h']]],
['print_5fint_5fvalue_24',['print_int_value',['../d9/deb/min__printf_8h.html#a0a848efdf2ee124bba62e056eb9ab824',1,'min_printf.h']]],
['print_5fmatrix_25',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_26',['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']]],
['print_5fstring_27',['print_string',['../d9/deb/min__printf_8h.html#af569209570eca8bc6770fb7d9dc873e6',1,'min_printf.h']]],
['print_5fvector_28',['print_vector',['../de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af',1,'vectors_3d.c']]],
['printeps_29',['printEPS',['../d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a',1,'k_means_clustering.c']]],
['printleaks_30',['printLeaks',['../d2/ddd/malloc__dbg_8h.html#abfd0a4452069af4cfefe4a5d037e92ef',1,'printLeaks(void):&#160;malloc_dbg.c'],['../db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797',1,'printLeaks():&#160;malloc_dbg.c']]],
['printmessage_31',['printMessage',['../db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef',1,'naval_battle.c']]],
['printmessagescore_32',['printMessageScore',['../db/de2/naval__battle_8c.html#a2d65de2c86c7015d7ca400dfca0f25dc',1,'naval_battle.c']]],
['printpositioning_33',['printPositioning',['../db/de2/naval__battle_8c.html#a5c84d83e31ca6a320b6ea8081402686a',1,'naval_battle.c']]],
['printsolution_34',['printSolution',['../d8/d1e/matrix__chain__order_8c.html#ab49bc6e377a4b72a1295a953bc2520f5',1,'matrix_chain_order.c']]],
['printstray_35',['printsTray',['../db/de2/naval__battle_8c.html#ad527fa96e729742a231c4535e112526a',1,'naval_battle.c']]],
['printtable_36',['printTable',['../db/de2/naval__battle_8c.html#a3889e1ee574e03ffdde8804180d57543',1,'naval_battle.c']]],
['priority_37',['priority',['../d5/da1/structnode.html#a44e51013eb31fc1f17866ca9fe8ac75b',1,'node::priority()'],['../da/d96/infix__to__postfix2_8c.html#a02d1bf0ff997efc46ba6fd0ec7952952',1,'priority(char opr):&#160;infix_to_postfix2.c']]],
['problem_38',['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']]],
['projecteuler_39',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
['propagate_40',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]],
['ptr_41',['ptr',['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a6b0971c1415de6e0123b8d0d0a626fde',1,'MEMORY_INFORMATION']]],
['purge_42',['purge',['../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241',1,'binary_search_tree.c']]],
['push_43',['push',['../db/d0c/infix__to__postfix_8c.html#a613462735d30cae1b85b606ecab30554',1,'push(struct Stack *p, char x):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a90e051f23f741be4f8ca86c270d66489',1,'push(char opd):&#160;infix_to_postfix2.c'],['../df/dfa/vector_8c.html#a878dddf838dbd6d5a9a1da77a362ce56',1,'push(Vector *vec, int val):&#160;vector.c'],['../df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef',1,'push(int8_t opd):&#160;postfix_evaluation.c']]],
['put_5fchar_44',['put_char',['../d9/deb/min__printf_8h.html#ad2f9a02e1d69f58e2fb1248f49d09f4b',1,'min_printf.h']]]
['patience_5fsort_2ec_1',['patience_sort.c',['../d2/d57/patience__sort_8c.html',1,'']]],
['patiencesort_2',['patienceSort',['../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8',1,'patience_sort.c']]],
['pid_3',['pid',['../d0/d43/structpid.html',1,'']]],
['pitch_4',['pitch',['../d2/de8/structeuler__.html#aa71f9aa6dfa32d8014b2d54ab8410e0b',1,'euler_']]],
['poly_5fadd_5',['poly_add',['../d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af',1,'poly_add.c']]],
['poly_5fadd_2ec_6',['poly_add.c',['../d0/dcb/poly__add_8c.html',1,'']]],
['poly_5ffunction_7',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['pop_8',['pop',['../db/d0c/infix__to__postfix_8c.html#a940cdcd27c40699eebb4ef113b2d9451',1,'pop(struct Stack *p):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a312e7f6c761a199c1369fbe651e084f0',1,'pop():&#160;infix_to_postfix2.c'],['../df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d',1,'pop():&#160;postfix_evaluation.c']]],
['port_9',['PORT',['../d8/dca/udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_server.c'],['../dd/d93/client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;client.c'],['../d9/ddd/remote__command__exec__udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;remote_command_exec_udp_client.c'],['../dd/d79/remote__command__exec__udp__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;remote_command_exec_udp_server.c'],['../d1/d20/server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;server.c'],['../d1/d98/tcp__full__duplex__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_full_duplex_client.c'],['../d1/d6b/tcp__full__duplex__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_full_duplex_server.c'],['../da/d07/tcp__half__duplex__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_half_duplex_client.c'],['../d6/d2b/tcp__half__duplex__server_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;tcp_half_duplex_server.c'],['../da/de6/udp__client_8c.html#a614217d263be1fb1a5f76e2ff7be19a2',1,'PORT():&#160;udp_client.c']]],
['positionboat_10',['positionBoat',['../db/de2/naval__battle_8c.html#a3f7d3dc5931fba6164e73057859094d9',1,'naval_battle.c']]],
['postfix_5fevaluation_2ec_11',['postfix_evaluation.c',['../df/d43/postfix__evaluation_8c.html',1,'']]],
['postorder_5fdisplay_12',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['pow_13',['pow',['../df/d86/structterm.html#a057f161d279d856d11786aa96fc87f74',1,'term']]],
['power_5fof_5ften_14',['power_of_ten',['../d9/deb/min__printf_8h.html#a8421f89b76edcf21292c5100bfca586b',1,'min_printf.h']]],
['preorder_5fdisplay_15',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prev_16',['prev',['../d8/d10/structlist.html#a2054c799f7580787a500df82d14ace25',1,'list']]],
['prev_5fdigit_17',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]],
['previous_18',['previous',['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a1cec46413acf776e3ee2b0b9241490c3',1,'MEMORY_INFORMATION']]],
['prim_19',['prim',['../d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853',1,'prim.c']]],
['prim_2ec_20',['prim.c',['../d9/dcc/prim_8c.html',1,'']]],
['prime_21',['prime',['../d1/ded/group__misc.html#gac1a7a8e00eeb590511465c28fae16e54',1,'prime_sieve.c']]],
['prime_2ec_22',['prime.c',['../da/d93/prime_8c.html',1,'']]],
['prime_5fsieve_2ec_23',['prime_sieve.c',['../dd/dd3/prime__sieve_8c.html',1,'']]],
['print_24',['print',['../dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0',1,'print(List *list):&#160;doubly_linked_list.c'],['../df/dfa/vector_8c.html#abdb067a98f90bcd9b0aa4ceb364d607f',1,'print(Vector *vec):&#160;vector.c'],['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head):&#160;cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a):&#160;sudoku_solver.c']]],
['print_5fdouble_5fvalue_25',['print_double_value',['../d9/deb/min__printf_8h.html#a4d63203d920bebd6a96f5f4aeccb21e5',1,'min_printf.h']]],
['print_5fint_5fvalue_26',['print_int_value',['../d9/deb/min__printf_8h.html#a0a848efdf2ee124bba62e056eb9ab824',1,'min_printf.h']]],
['print_5fmatrix_27',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_28',['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']]],
['print_5fstring_29',['print_string',['../d9/deb/min__printf_8h.html#af569209570eca8bc6770fb7d9dc873e6',1,'min_printf.h']]],
['print_5fvector_30',['print_vector',['../de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af',1,'vectors_3d.c']]],
['printarray_31',['printArray',['../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19',1,'patience_sort.c']]],
['printeps_32',['printEPS',['../d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a',1,'k_means_clustering.c']]],
['printleaks_33',['printLeaks',['../db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797',1,'printLeaks():&#160;malloc_dbg.c'],['../d2/ddd/malloc__dbg_8h.html#abfd0a4452069af4cfefe4a5d037e92ef',1,'printLeaks(void):&#160;malloc_dbg.c']]],
['printmessage_34',['printMessage',['../db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef',1,'naval_battle.c']]],
['printmessagescore_35',['printMessageScore',['../db/de2/naval__battle_8c.html#a2d65de2c86c7015d7ca400dfca0f25dc',1,'naval_battle.c']]],
['printpositioning_36',['printPositioning',['../db/de2/naval__battle_8c.html#a5c84d83e31ca6a320b6ea8081402686a',1,'naval_battle.c']]],
['printsolution_37',['printSolution',['../d8/d1e/matrix__chain__order_8c.html#ab49bc6e377a4b72a1295a953bc2520f5',1,'matrix_chain_order.c']]],
['printstray_38',['printsTray',['../db/de2/naval__battle_8c.html#ad527fa96e729742a231c4535e112526a',1,'naval_battle.c']]],
['printtable_39',['printTable',['../db/de2/naval__battle_8c.html#a3889e1ee574e03ffdde8804180d57543',1,'naval_battle.c']]],
['priority_40',['priority',['../d5/da1/structnode.html#a44e51013eb31fc1f17866ca9fe8ac75b',1,'node::priority()'],['../da/d96/infix__to__postfix2_8c.html#a02d1bf0ff997efc46ba6fd0ec7952952',1,'priority(char opr):&#160;infix_to_postfix2.c']]],
['problem_41',['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']]],
['projecteuler_42',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]],
['propagate_43',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]],
['ptr_44',['ptr',['../d4/d73/struct_m_e_m_o_r_y___i_n_f_o_r_m_a_t_i_o_n.html#a6b0971c1415de6e0123b8d0d0a626fde',1,'MEMORY_INFORMATION']]],
['purge_45',['purge',['../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241',1,'binary_search_tree.c']]],
['push_46',['push',['../db/d0c/infix__to__postfix_8c.html#a613462735d30cae1b85b606ecab30554',1,'push(struct Stack *p, char x):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a90e051f23f741be4f8ca86c270d66489',1,'push(char opd):&#160;infix_to_postfix2.c'],['../df/dfa/vector_8c.html#a878dddf838dbd6d5a9a1da77a362ce56',1,'push(Vector *vec, int val):&#160;vector.c'],['../df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef',1,'push(int8_t opd):&#160;postfix_evaluation.c']]],
['put_5fchar_47',['put_char',['../d9/deb/min__printf_8h.html#ad2f9a02e1d69f58e2fb1248f49d09f4b',1,'min_printf.h']]]
];

View File

@ -7,7 +7,7 @@ var searchData=
['tcp_5fhalf_5fduplex_5fclient_2ec_4',['tcp_half_duplex_client.c',['../da/d07/tcp__half__duplex__client_8c.html',1,'']]],
['tcp_5fhalf_5fduplex_5fserver_2ec_5',['tcp_half_duplex_server.c',['../d6/d2b/tcp__half__duplex__server_8c.html',1,'']]],
['term_6',['term',['../df/d86/structterm.html',1,'']]],
['test_7',['test',['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algorithm.c'],['../d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort_2.c'],['../dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c'],['../d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;odd_even_sort.c'],['../de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort_recursive.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5',1,'test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t len):&#160;alaw.c'],['../d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;celsius_to_fahrenheit.c'],['../d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_any_base.c'],['../d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_binary_recursion.c'],['../da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;infix_to_postfix2.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;octal_to_hexadecimal.c'],['../dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;roman_numerals_to_decimal.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;words_alphabetical.c'],['../df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector.c'],['../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcs.c'],['../d8/d1e/matrix__chain__order_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;matrix_chain_order.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c',1,'test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V):&#160;prim.c'],['../d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;6.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_formula.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prime_sieve.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../d5/da4/hamming__distance_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;hamming_distance.c'],['../df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;postfix_evaluation.c'],['../de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rot13.c'],['../d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;run_length_encoding.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;non_preemptive_priority_scheduling.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_search.c'],['../de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;heap_sort_2.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sentinel_linear_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c']]],
['test_7',['test',['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;jump_search.c'],['../d5/d38/bubble__sort__recursion_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort_recursion.c'],['../dc/d39/selection__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.c'],['../df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort.c'],['../d2/d57/patience__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;patience_sort.c'],['../d1/d94/odd__even__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;odd_even_sort.c'],['../de/d0c/insertion__sort__recursive_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort_recursive.c'],['../df/d27/alaw_8c.html#a840bf13d2e4d75d38fb7bf3a655152f5',1,'test(int16_t *pcm, uint8_t *coded, int16_t *decoded, size_t len):&#160;alaw.c'],['../d0/d51/celsius__to__fahrenheit_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;celsius_to_fahrenheit.c'],['../d1/dba/decimal__to__any__base_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_any_base.c'],['../d8/d30/decimal__to__binary__recursion_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;decimal_to_binary_recursion.c'],['../da/d96/infix__to__postfix2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;infix_to_postfix2.c'],['../dd/d53/int__to__string_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;int_to_string.c'],['../d0/d8a/octal__to__hexadecimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;octal_to_hexadecimal.c'],['../dd/de6/roman__numerals__to__decimal_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;roman_numerals_to_decimal.c'],['../da/da0/segment__tree_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.c'],['../d3/d78/words__alphabetical_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;words_alphabetical.c'],['../df/dfa/vector_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector.c'],['../db/de1/lcs_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcs.c'],['../d8/d1e/matrix__chain__order_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;matrix_chain_order.c'],['../d5/db8/vectors__3d_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vectors_3d.c'],['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void):&#160;spirograph.c'],['../d9/dcc/prim_8c.html#aff3f4c22009b2aa4e385a76a8a1cdc1c',1,'test(uint16_t G[][MAX], uint16_t MST[][MAX], uint16_t V):&#160;prim.c'],['../d0/df3/6_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;6.c'],['../d6/d76/k__means__clustering_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_means_clustering.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;cartesian_to_polar.c'],['../d8/d75/fibonacci__formula_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_formula.c'],['../da/d93/prime_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;prime.c'],['../d1/ded/group__misc.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prime_sieve.c'],['../d4/dcc/strong__number_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;strong_number.c'],['../d5/da4/hamming__distance_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;hamming_distance.c'],['../df/d43/postfix__evaluation_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;postfix_evaluation.c'],['../de/dcf/rot13_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rot13.c'],['../d1/dc7/run__length__encoding_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;run_length_encoding.c'],['../d2/d87/non__preemptive__priority__scheduling_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;non_preemptive_priority_scheduling.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;binary_search.c'],['../da/d6c/exponential__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_search.c'],['../d2/d9b/floyd__cycle__detection__algorithm_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algorithm.c'],['../db/ddf/insertion__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;insertion_sort.c'],['../d5/de2/sentinel__linear__search_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sentinel_linear_search.c'],['../dd/de4/bubble__sort_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bubble_sort.c'],['../d2/d6d/bubble__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort_2.c'],['../de/dff/heap__sort__2_8c.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;heap_sort_2.c']]],
['test1_8',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#ab215107dbb50c7efa811a687ce9b95af',1,'test1(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.c']]],
['test2_9',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta):&#160;adaline_learning.c'],['../d6/d76/k__means__clustering_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;k_means_clustering.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#a0c5173884bd798a6ca6f437b9b932409',1,'test2(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.c']]],
['test3_10',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta):&#160;adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.c'],['../d0/dcb/poly__add_8c.html#ab138609c765e2fd8b89e9c107cd40d57',1,'test3(struct term *poly1, struct term *poly2, struct term *poly3):&#160;poly_add.c']]],
@ -26,13 +26,14 @@ var searchData=
['test_5fmin_5fprintf_2ec_23',['test_min_printf.c',['../d5/d5c/test__min__printf_8c.html',1,'']]],
['test_5fsdbm_24',['test_sdbm',['../d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453',1,'hash_sdbm.c']]],
['test_5fxor8_25',['test_xor8',['../d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0',1,'hash_xor8.c']]],
['testzigzag_26',['testZigZag',['../d0/df3/6_8c.html#a109c3813445bcf97d154a671119deae9',1,'6.c']]],
['the_20algorithms_20_2d_20c_27',['The Algorithms - C',['../index.html',1,'']]],
['threaded_5fbinary_5ftrees_2ec_28',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_29',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['to_5fpolar_30',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]],
['top_31',['top',['../dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a',1,'Stack']]],
['top_32',['Top',['../da/d96/infix__to__postfix2_8c.html#a2d1c13296ce9c42bb5dd7d834e2802bf',1,'infix_to_postfix2.c']]],
['tos_33',['tos',['../dd/d10/struct_stack.html#ac2dbef151bc913684a90b06836725ef9',1,'Stack']]],
['trie_34',['trie',['../d4/dd9/structtrie.html',1,'']]]
['testarray_26',['testArray',['../d2/d57/patience__sort_8c.html#af0cc492037e002ba5145e2e770ed0e66',1,'patience_sort.c']]],
['testzigzag_27',['testZigZag',['../d0/df3/6_8c.html#a109c3813445bcf97d154a671119deae9',1,'6.c']]],
['the_20algorithms_20_2d_20c_28',['The Algorithms - C',['../index.html',1,'']]],
['threaded_5fbinary_5ftrees_2ec_29',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]],
['tnode_30',['tnode',['../d8/d7a/structtnode.html',1,'']]],
['to_5fpolar_31',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]],
['top_32',['top',['../dd/d10/struct_stack.html#ad62fb36816185f3eef3a6f735a61f54a',1,'Stack']]],
['top_33',['Top',['../da/d96/infix__to__postfix2_8c.html#a2d1c13296ce9c42bb5dd7d834e2802bf',1,'infix_to_postfix2.c']]],
['tos_34',['tos',['../dd/d10/struct_stack.html#ac2dbef151bc913684a90b06836725ef9',1,'Stack']]],
['trie_35',['trie',['../d4/dd9/structtrie.html',1,'']]]
];

File diff suppressed because one or more lines are too long

View File

@ -1,9 +1,10 @@
var searchData=
[
['palindrome_2ec_0',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]],
['poly_5fadd_2ec_1',['poly_add.c',['../d0/dcb/poly__add_8c.html',1,'']]],
['postfix_5fevaluation_2ec_2',['postfix_evaluation.c',['../df/d43/postfix__evaluation_8c.html',1,'']]],
['prim_2ec_3',['prim.c',['../d9/dcc/prim_8c.html',1,'']]],
['prime_2ec_4',['prime.c',['../da/d93/prime_8c.html',1,'']]],
['prime_5fsieve_2ec_5',['prime_sieve.c',['../dd/dd3/prime__sieve_8c.html',1,'']]]
['patience_5fsort_2ec_1',['patience_sort.c',['../d2/d57/patience__sort_8c.html',1,'']]],
['poly_5fadd_2ec_2',['poly_add.c',['../d0/dcb/poly__add_8c.html',1,'']]],
['postfix_5fevaluation_2ec_3',['postfix_evaluation.c',['../df/d43/postfix__evaluation_8c.html',1,'']]],
['prim_2ec_4',['prim.c',['../d9/dcc/prim_8c.html',1,'']]],
['prime_2ec_5',['prime.c',['../da/d93/prime_8c.html',1,'']]],
['prime_5fsieve_2ec_6',['prime_sieve.c',['../dd/dd3/prime__sieve_8c.html',1,'']]]
];

View File

@ -1,33 +1,35 @@
var searchData=
[
['poly_5fadd_0',['poly_add',['../d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af',1,'poly_add.c']]],
['poly_5ffunction_1',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['pop_2',['pop',['../db/d0c/infix__to__postfix_8c.html#a940cdcd27c40699eebb4ef113b2d9451',1,'pop(struct Stack *p):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a312e7f6c761a199c1369fbe651e084f0',1,'pop():&#160;infix_to_postfix2.c'],['../df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d',1,'pop():&#160;postfix_evaluation.c']]],
['positionboat_3',['positionBoat',['../db/de2/naval__battle_8c.html#a3f7d3dc5931fba6164e73057859094d9',1,'naval_battle.c']]],
['postorder_5fdisplay_4',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['power_5fof_5ften_5',['power_of_ten',['../d9/deb/min__printf_8h.html#a8421f89b76edcf21292c5100bfca586b',1,'min_printf.h']]],
['preorder_5fdisplay_6',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prim_7',['prim',['../d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853',1,'prim.c']]],
['prime_8',['prime',['../d1/ded/group__misc.html#gac1a7a8e00eeb590511465c28fae16e54',1,'prime_sieve.c']]],
['print_9',['print',['../dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0',1,'print(List *list):&#160;doubly_linked_list.c'],['../df/dfa/vector_8c.html#abdb067a98f90bcd9b0aa4ceb364d607f',1,'print(Vector *vec):&#160;vector.c'],['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head):&#160;cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a):&#160;sudoku_solver.c']]],
['print_5fdouble_5fvalue_10',['print_double_value',['../d9/deb/min__printf_8h.html#a4d63203d920bebd6a96f5f4aeccb21e5',1,'min_printf.h']]],
['print_5fint_5fvalue_11',['print_int_value',['../d9/deb/min__printf_8h.html#a0a848efdf2ee124bba62e056eb9ab824',1,'min_printf.h']]],
['print_5fmatrix_12',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_13',['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']]],
['print_5fstring_14',['print_string',['../d9/deb/min__printf_8h.html#af569209570eca8bc6770fb7d9dc873e6',1,'min_printf.h']]],
['print_5fvector_15',['print_vector',['../de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af',1,'vectors_3d.c']]],
['printeps_16',['printEPS',['../d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a',1,'k_means_clustering.c']]],
['printleaks_17',['printLeaks',['../db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797',1,'printLeaks():&#160;malloc_dbg.c'],['../d2/ddd/malloc__dbg_8h.html#abfd0a4452069af4cfefe4a5d037e92ef',1,'printLeaks(void):&#160;malloc_dbg.c']]],
['printmessage_18',['printMessage',['../db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef',1,'naval_battle.c']]],
['printmessagescore_19',['printMessageScore',['../db/de2/naval__battle_8c.html#a2d65de2c86c7015d7ca400dfca0f25dc',1,'naval_battle.c']]],
['printpositioning_20',['printPositioning',['../db/de2/naval__battle_8c.html#a5c84d83e31ca6a320b6ea8081402686a',1,'naval_battle.c']]],
['printsolution_21',['printSolution',['../d8/d1e/matrix__chain__order_8c.html#ab49bc6e377a4b72a1295a953bc2520f5',1,'matrix_chain_order.c']]],
['printstray_22',['printsTray',['../db/de2/naval__battle_8c.html#ad527fa96e729742a231c4535e112526a',1,'naval_battle.c']]],
['printtable_23',['printTable',['../db/de2/naval__battle_8c.html#a3889e1ee574e03ffdde8804180d57543',1,'naval_battle.c']]],
['priority_24',['priority',['../da/d96/infix__to__postfix2_8c.html#a02d1bf0ff997efc46ba6fd0ec7952952',1,'infix_to_postfix2.c']]],
['problem_25',['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_26',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]],
['purge_27',['purge',['../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241',1,'binary_search_tree.c']]],
['push_28',['push',['../db/d0c/infix__to__postfix_8c.html#a613462735d30cae1b85b606ecab30554',1,'push(struct Stack *p, char x):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a90e051f23f741be4f8ca86c270d66489',1,'push(char opd):&#160;infix_to_postfix2.c'],['../df/dfa/vector_8c.html#a878dddf838dbd6d5a9a1da77a362ce56',1,'push(Vector *vec, int val):&#160;vector.c'],['../df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef',1,'push(int8_t opd):&#160;postfix_evaluation.c']]],
['put_5fchar_29',['put_char',['../d9/deb/min__printf_8h.html#ad2f9a02e1d69f58e2fb1248f49d09f4b',1,'min_printf.h']]]
['patiencesort_0',['patienceSort',['../d2/d57/patience__sort_8c.html#a5ce3f8e766a38377168ae737605745c8',1,'patience_sort.c']]],
['poly_5fadd_1',['poly_add',['../d0/dcb/poly__add_8c.html#a6ff38afe4720527c9513139cbab460af',1,'poly_add.c']]],
['poly_5ffunction_2',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]],
['pop_3',['pop',['../db/d0c/infix__to__postfix_8c.html#a940cdcd27c40699eebb4ef113b2d9451',1,'pop(struct Stack *p):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a312e7f6c761a199c1369fbe651e084f0',1,'pop():&#160;infix_to_postfix2.c'],['../df/d43/postfix__evaluation_8c.html#a8546e4b3f61be1f09ce47f428116ad7d',1,'pop():&#160;postfix_evaluation.c']]],
['positionboat_4',['positionBoat',['../db/de2/naval__battle_8c.html#a3f7d3dc5931fba6164e73057859094d9',1,'naval_battle.c']]],
['postorder_5fdisplay_5',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]],
['power_5fof_5ften_6',['power_of_ten',['../d9/deb/min__printf_8h.html#a8421f89b76edcf21292c5100bfca586b',1,'min_printf.h']]],
['preorder_5fdisplay_7',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]],
['prim_8',['prim',['../d9/dcc/prim_8c.html#a0bea087eb586c437cf0a667f794c8853',1,'prim.c']]],
['prime_9',['prime',['../d1/ded/group__misc.html#gac1a7a8e00eeb590511465c28fae16e54',1,'prime_sieve.c']]],
['print_10',['print',['../dd/d29/doubly__linked__list_8c.html#a1fadec32fc369a8dcfbcd766e166efa0',1,'print(List *list):&#160;doubly_linked_list.c'],['../df/dfa/vector_8c.html#abdb067a98f90bcd9b0aa4ceb364d607f',1,'print(Vector *vec):&#160;vector.c'],['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head):&#160;cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a):&#160;sudoku_solver.c']]],
['print_5fdouble_5fvalue_11',['print_double_value',['../d9/deb/min__printf_8h.html#a4d63203d920bebd6a96f5f4aeccb21e5',1,'min_printf.h']]],
['print_5fint_5fvalue_12',['print_int_value',['../d9/deb/min__printf_8h.html#a0a848efdf2ee124bba62e056eb9ab824',1,'min_printf.h']]],
['print_5fmatrix_13',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]],
['print_5fnumber_14',['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']]],
['print_5fstring_15',['print_string',['../d9/deb/min__printf_8h.html#af569209570eca8bc6770fb7d9dc873e6',1,'min_printf.h']]],
['print_5fvector_16',['print_vector',['../de/d7b/group__vec__3d.html#gae25e1f2e973933bef65838601e2de0af',1,'vectors_3d.c']]],
['printarray_17',['printArray',['../d2/d57/patience__sort_8c.html#a51db6714f25747b7de0daca675363e19',1,'patience_sort.c']]],
['printeps_18',['printEPS',['../d6/d76/k__means__clustering_8c.html#a5b4ba704e02672e59cfa35f82e3db28a',1,'k_means_clustering.c']]],
['printleaks_19',['printLeaks',['../db/d84/malloc__dbg_8c.html#a2a47e4c38db8c00b80248e5535adf797',1,'printLeaks():&#160;malloc_dbg.c'],['../d2/ddd/malloc__dbg_8h.html#abfd0a4452069af4cfefe4a5d037e92ef',1,'printLeaks(void):&#160;malloc_dbg.c']]],
['printmessage_20',['printMessage',['../db/de2/naval__battle_8c.html#a521043b369238e618dcc9364b40448ef',1,'naval_battle.c']]],
['printmessagescore_21',['printMessageScore',['../db/de2/naval__battle_8c.html#a2d65de2c86c7015d7ca400dfca0f25dc',1,'naval_battle.c']]],
['printpositioning_22',['printPositioning',['../db/de2/naval__battle_8c.html#a5c84d83e31ca6a320b6ea8081402686a',1,'naval_battle.c']]],
['printsolution_23',['printSolution',['../d8/d1e/matrix__chain__order_8c.html#ab49bc6e377a4b72a1295a953bc2520f5',1,'matrix_chain_order.c']]],
['printstray_24',['printsTray',['../db/de2/naval__battle_8c.html#ad527fa96e729742a231c4535e112526a',1,'naval_battle.c']]],
['printtable_25',['printTable',['../db/de2/naval__battle_8c.html#a3889e1ee574e03ffdde8804180d57543',1,'naval_battle.c']]],
['priority_26',['priority',['../da/d96/infix__to__postfix2_8c.html#a02d1bf0ff997efc46ba6fd0ec7952952',1,'infix_to_postfix2.c']]],
['problem_27',['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_28',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]],
['purge_29',['purge',['../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241',1,'binary_search_tree.c']]],
['push_30',['push',['../db/d0c/infix__to__postfix_8c.html#a613462735d30cae1b85b606ecab30554',1,'push(struct Stack *p, char x):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a90e051f23f741be4f8ca86c270d66489',1,'push(char opd):&#160;infix_to_postfix2.c'],['../df/dfa/vector_8c.html#a878dddf838dbd6d5a9a1da77a362ce56',1,'push(Vector *vec, int val):&#160;vector.c'],['../df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef',1,'push(int8_t opd):&#160;postfix_evaluation.c']]],
['put_5fchar_31',['put_char',['../d9/deb/min__printf_8h.html#ad2f9a02e1d69f58e2fb1248f49d09f4b',1,'min_printf.h']]]
];

View File

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

File diff suppressed because one or more lines are too long