backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 46854f516e

Browse Source
This commit is contained in:
github-actions
2020-06-24 20:43:26 +00:00
parent bddecb38fb
commit cf1a6d4366
325 changed files with 1476 additions and 1513 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d4/d1f/class_min_heap-members.html
View File

@@ -116,7 +116,7 @@ $(document).ready(function(){initNavTree('d2/d05/class_min_heap.html','../../');
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Wed Jun 24 2020 17:40:29 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:37 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/d21/least__common__multiple_8cpp.html
View File

@@ -284,7 +284,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d21/least__common__multiple_8cpp.html">least_common_multiple.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

117
d4/d32/fibonacci__fast_8cpp.html
View File

@@ -91,8 +91,8 @@ $(document).ready(function(){initNavTree('d4/d32/fibonacci__fast_8cpp.html','../
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<a href="#define-members">Macros</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">fibonacci_fast.cpp File Reference</div> </div>
</div><!--header-->
@@ -110,26 +110,40 @@ Include dependency graph for fibonacci_fast.cpp:</div>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;93</td></tr>
<tr class="separator:a392fb874e547e582e9c66a08a1f23326"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a5712edca101204eca8accdb1e096707f"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a> (uint64_t n)</td></tr>
<tr class="separator:a5712edca101204eca8accdb1e096707f"><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="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a692ac7187ee88621a9f78fca78ec498d"><td class="memItemLeft" align="right" valign="top">const uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d">MAX</a> = 93</td></tr>
<tr class="separator:a692ac7187ee88621a9f78fca78ec498d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3ba232425d45f9e9c0b87a8cf7ab69d9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a> [<a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d">MAX</a>] = {0}</td></tr>
<tr class="separator:a3ba232425d45f9e9c0b87a8cf7ab69d9"><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>Faster computation of Fibonacci series. </p>
<p>An efficient way to calculate nth fibonacci number faster and simpler than \(O(n\log n)\) method of matrix exponentiation This works by using both recursion and dynamic programming. as 93rd fibonacci exceeds 19 digits, which cannot be stored in a single long long variable, we can only use it till 92nd fibonacci we can use it for 10000th fibonacci etc, if we implement bigintegers. This algorithm works with the fact that nth fibonacci can easily found if we have already found n/2th or (n+1)/2th fibonacci It is a property of fibonacci similar to matrix exponentiation.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala">Krishna Vedala</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/de4/fibonacci__large_8cpp.html" title="Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library ...">fibonacci_large.cpp</a>, <a class="el" href="../../d9/d89/fibonacci_8cpp.html" title="Generate fibonacci sequence.">fibonacci.cpp</a>, <a class="el" href="../../de/d47/string__fibonacci_8cpp.html" title="This Programme returns the Nth fibonacci as a string.">string_fibonacci.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
</div><h2 class="groupheader">Macro Definition Documentation</h2>
<a id="a392fb874e547e582e9c66a08a1f23326"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&nbsp;</a></span>MAX</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define MAX&#160;&#160;&#160;93</td>
</tr>
</table>
</div><div class="memdoc">
<p>maximum number that can be computed - The result after 93 cannot be stored in a <code>uint64_t</code> data type. </p>
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a5712edca101204eca8accdb1e096707f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5712edca101204eca8accdb1e096707f">&#9670;&nbsp;</a></span>fib()</h2>
@@ -147,20 +161,24 @@ Variables</h2></td></tr>
</div><div class="memdoc">
<p>Algorithm </p>
<div class="fragment"><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; {</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <span class="keywordflow">if</span> (n == 0)</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; <span class="keywordflow">if</span> (n == 1 || n == 2)</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="keywordflow">return</span> (<a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a>[n] = 1);</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; </div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a>[n])</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a>[n];</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; uint64_t <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a> = (n % 2 != 0) ? (n + 1) / 2 : n / 2;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; </div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a>[n] = (n % 2 != 0) ? (<a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a>) * <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a>) + <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a> - 1) * <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a> - 1))</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; : (2 * <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a> - 1) + <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a>)) * <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a>);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a>[n];</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;}</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <span class="keyword">static</span> uint64_t f1 = 1,</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; f2 = 1; <span class="comment">// using static keyword will retain the values of</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; <span class="comment">// f1 and f2 for the next function call.</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; </div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <span class="keywordflow">if</span> (n &lt;= 2)</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keywordflow">return</span> f2;</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordflow">if</span> (n &gt;= 93) {</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; &lt;&lt; <span class="stringliteral">&quot;Cannot compute for n&gt;93 due to limit of 64-bit integers\n&quot;</span>;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; }</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; </div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; uint64_t temp = f2; <span class="comment">// we do not need temp to be static</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; f2 += f1;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; f1 = temp;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; </div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keywordflow">return</span> f2;</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
@@ -179,13 +197,13 @@ Variables</h2></td></tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="comment">// Main Function</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; 93; i++) {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; th fibonacci number is &quot;</span> &lt;&lt; <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(i) &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; }</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160;}</div>
<div class="fragment"><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; {</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="comment">// Main Function</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; 93; i++) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; th fibonacci number is &quot;</span> &lt;&lt; <a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(i) &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; }</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -193,51 +211,18 @@ Here is the call graph for this function:</div>
</div>
</div>
</div>
</div>
<h2 class="groupheader">Variable Documentation</h2>
<a id="a3ba232425d45f9e9c0b87a8cf7ab69d9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3ba232425d45f9e9c0b87a8cf7ab69d9">&#9670;&nbsp;</a></span>f</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">uint64_t f[<a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d">MAX</a>] = {0}</td>
</tr>
</table>
</div><div class="memdoc">
<p>Array of computed fibonacci numbers </p>
</div>
</div>
<a id="a692ac7187ee88621a9f78fca78ec498d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a692ac7187ee88621a9f78fca78ec498d">&#9670;&nbsp;</a></span>MAX</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">const uint64_t MAX = 93</td>
</tr>
</table>
</div><div class="memdoc">
<p>maximum number that can be computed - The result after 93 cannot be stored in a <code>uint64_t</code> data type. </p>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="afibonacci__fast_8cpp_html_a3ba232425d45f9e9c0b87a8cf7ab69d9"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a></div><div class="ttdeci">uint64_t f[MAX]</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_afcf0d19607cd0edd8ae333d2b9c220c0"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0">k</a></div><div class="ttdeci">ll k</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:48</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:30</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html">fibonacci_fast.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

5
d4/d32/fibonacci__fast_8cpp.js vendored
View File

@@ -1,7 +1,6 @@
var fibonacci__fast_8cpp =
[
[ "MAX", "d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ],
[ "fib", "d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f", null ],
[ "main", "d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "f", "d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9", null ],
[ "MAX", "d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d", null ]
[ "main", "d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
];

2
d4/d45/gcd__recursive__euclidean_8cpp.html
View File

@@ -216,7 +216,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html">gcd_recursive_euclidean.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/d68/qr__decompose_8h.html
View File

@@ -158,7 +158,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

3
d4/d68/qr__decompose_8h_source.html
View File

@@ -326,7 +326,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div>
<div class="ttc" id="aprime__numbers_8cpp_html_a3b91f208e8365c95a295cfe3e67df5c3"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(int max)</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:12</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:125</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a3ba232425d45f9e9c0b87a8cf7ab69d9"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a></div><div class="ttdeci">uint64_t f[MAX]</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a67249e31221231cf3aaf3cfd870372d0"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0">operator+</a></div><div class="ttdeci">std::vector&lt; T &gt; operator+(std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:196</div></div>
<div class="ttc" id="anewton__raphson__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition:</b> newton_raphson_method.cpp:29</div></div>
@@ -496,7 +495,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:27 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/d6d/struct_entry-members.html
View File

@@ -106,7 +106,7 @@ $(document).ready(function(){initNavTree('dd/d3b/struct_entry.html','../../'); i
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Wed Jun 24 2020 17:40:29 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:37 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

5
d4/d7a/shell__sort2_8cpp.html
View File

@@ -266,7 +266,7 @@ template&lt;typename T &gt; </div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; &lt;&lt; <span class="stringliteral">&quot;Data Sorted using custom implementation: &quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <a class="code" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; </div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="keywordtype">double</span> elapsed_time = (<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) * 1.<a class="code" href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a> / CLOCKS_PER_SEC;</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="keywordtype">double</span> elapsed_time = (<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) * 1.f / CLOCKS_PER_SEC;</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time spent sorting: &quot;</span> &lt;&lt; elapsed_time &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; </div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <span class="keyword">delete</span>[] <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
@@ -494,7 +494,6 @@ Here is the call graph for this function:</div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a22ea0d1f7943ebb4371d31e44b465b6d"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a></div><div class="ttdeci">void test_f(const int NUM_DATA)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:145</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a951127aea9d7e1e53ea9ae0868633246"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a></div><div class="ttdeci">void show_data(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:18</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a3ba232425d45f9e9c0b87a8cf7ab69d9"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a></div><div class="ttdeci">uint64_t f[MAX]</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a895b313cb2671e8f712040460325573e"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">test_int</a></div><div class="ttdeci">void test_int(const int NUM_DATA)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:105</div></div>
@@ -513,7 +512,7 @@ Here is the call graph for this function:</div>
<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="../../d4/d7a/shell__sort2_8cpp.html">shell_sort2.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/d83/sum__of__digits_8cpp.html
View File

@@ -290,7 +290,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d83/sum__of__digits_8cpp.html">sum_of_digits.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/d86/large__number_8h.html
View File

@@ -135,7 +135,7 @@ Classes</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d86/large__number_8h.html">large_number.h</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

9
d4/d86/large__number_8h_source.html
View File

@@ -401,12 +401,12 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="adomain_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:122</div></div>
<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:17</div></div>
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="afabs_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a></div><div class="ttdeci">T fabs(T... args)</div></div>
<div class="ttc" id="ainner_product_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a></div><div class="ttdeci">T inner_product(T... args)</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a3ba232425d45f9e9c0b87a8cf7ab69d9"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9">f</a></div><div class="ttdeci">uint64_t f[MAX]</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:15</div></div>
<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:19</div></div>
@@ -434,7 +434,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="aclass_complex_html_aa9b4a7d6083ca7040ddd4fe93db5c19d"><div class="ttname"><a href="../../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex::operator*</a></div><div class="ttdeci">Complex operator*(const Complex &amp;other)</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:108</div></div>
<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition:</b> large_number.h:24</div></div>
<div class="ttc" id="afibonacci__large_8cpp_html_adf3e906875ab257f7fab3bc1370aa2db"><div class="ttname"><a href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a></div><div class="ttdeci">large_number fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_large.cpp:24</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:47</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:51</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_af50a5c87d27cfd3462745b37fb9b0f46"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46">print</a></div><div class="ttdeci">void print(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:40</div></div>
<div class="ttc" id="aiterator_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/iterator.html">std::iterator</a></div></div>
<div class="ttc" id="akohonen__som__topology_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:566</div></div>
@@ -476,6 +476,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ac8a9c2aaaa63b0f27ea176857e1e7d56"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">machine_learning::adaline::check_size_match</a></div><div class="ttdeci">bool check_size_match(const std::vector&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:176</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div>
<div class="ttc" id="astruct_entry_html"><div class="ttname"><a href="../../dd/d3b/struct_entry.html">Entry</a></div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:28</div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:225</div></div>
<div class="ttc" id="aclasslarge__number_html_ac27b399ed872731758ec33ebb102730e"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">large_number::operator+=</a></div><div class="ttdeci">large_number &amp; operator+=(large_number n)</div><div class="ttdef"><b>Definition:</b> large_number.h:192</div></div>
@@ -493,7 +494,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="afibonacci_8cpp_html_a4bc27e88a3da5cc590f1f78622019a7b"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#a4bc27e88a3da5cc590f1f78622019a7b">fibonacci</a></div><div class="ttdeci">int fibonacci(unsigned int n)</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:17</div></div>
<div class="ttc" id="aclass_trie_html_afd8b79959009b554e98ea7128b2886f2"><div class="ttname"><a href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:109</div></div>
<div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &amp;graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:206</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_af93f4f37fc2ad9c37af4a715423b110c"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af93f4f37fc2ad9c37af4a715423b110c">top</a></div><div class="ttdeci">int top</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div>
<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:523</div></div>
<div class="ttc" id="aavltree_8cpp_html_a1ecfaaea49d452772dbb2b28133e36e0"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:21</div></div>
<div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:153</div></div>
@@ -601,7 +601,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:132</div></div>
<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a></div><div class="ttdeci">T fixed(T... args)</div></div>
<div class="ttc" id="astruct_item_html"><div class="ttname"><a href="../../db/d66/struct_item.html">Item</a></div><div class="ttdef"><b>Definition:</b> knapsack.cpp:4</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a692ac7187ee88621a9f78fca78ec498d"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d">MAX</a></div><div class="ttdeci">const uint64_t MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:24</div></div>
<div class="ttc" id="astrtoul_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">std::strtoull</a></div><div class="ttdeci">T strtoull(T... args)</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
@@ -672,7 +671,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d86/large__number_8h.html">large_number.h</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:27 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/d9c/primes__up__to__billion_8cpp.html
View File

@@ -217,7 +217,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp.html">primes_up_to_billion.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/da0/gcd__iterative__euclidean_8cpp.html
View File

@@ -222,7 +222,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html">gcd_iterative_euclidean.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/db4/struct_segment_intersection.html
View File

@@ -231,7 +231,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:29 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:37 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/db6/struct_min_heap_node-members.html
View File

@@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d29/struct_min_heap_node.html','../
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Wed Jun 24 2020 17:40:29 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:37 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/dd9/structtrie.html
View File

@@ -122,7 +122,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>isEndofWord</b></td><
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d4/dd9/structtrie.html">trie</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:29 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:37 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/de8/fast__interger__input_8cpp.html
View File

@@ -202,7 +202,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d4/de8/fast__interger__input_8cpp.html">fast_interger_input.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:28 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>

2
d4/def/kohonen__som__topology_8cpp.html
View File

@@ -684,7 +684,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d4/def/kohonen__som__topology_8cpp.html">kohonen_som_topology.cpp</a></li>
<li class="footer">Generated on Wed Jun 24 2020 17:40:27 for Algorithms_in_C++ by
<li class="footer">Generated on Wed Jun 24 2020 20:42:36 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>