backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for f1ff652601

Browse Source
This commit is contained in:
realstealthninja
2025-08-23 14:47:19 +00:00
parent e2f8e1a989
commit 15431bdb7e
45 changed files with 1469 additions and 733 deletions
Download Patch File Download Diff File Expand all files Collapse all files

260
d2/d96/factorial__memoization_8cpp.html Normal file
View File

@@ -0,0 +1,260 @@
<!-- HTML header for doxygen 1.12.0-->
<!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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: math/factorial_memoization.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.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/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</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">
$(function(){initNavTree('d2/d96/factorial__memoization_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">factorial_memoization.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;array&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for factorial_memoization.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../db/d30/factorial__memoization_8cpp__incl.svg" width="330" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d2/d96/factorial__memoization_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:math" id="r_math"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a73b07abea036f1ce2e3ac5dc169bdb4b" id="r_a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a> (uint64_t n)</td></tr>
<tr class="memdesc:a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the factorial of a non-negative integer using recursion and memoization. <br /></td></tr>
<tr class="memitem:a4243a60d73b9e1296de20196d5b155ba" id="r_a4243a60d73b9e1296de20196d5b155ba"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a> ()</td></tr>
<tr class="memdesc:a4243a60d73b9e1296de20196d5b155ba"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations for the fact_recursion function. <br /></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function to run test cases and interact with the user. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a0f9b4d5fae79e1029daf9bd1b93ec217" id="r_a0f9b4d5fae79e1029daf9bd1b93ec217"><td class="memItemLeft" align="right" valign="top">std::array&lt; uint64_t, 1000 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> {0}</td></tr>
<tr class="memdesc:a0f9b4d5fae79e1029daf9bd1b93ec217"><td class="mdescLeft">&#160;</td><td class="mdescRight">Array to store computed factorials for memoization. <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a> </p>
<p>This program computes the factorial of a non-negative integer using recursion with memoization (top-down dynamic programming). It stores intermediate results to avoid redundant calculations for improved efficiency.</p>
<p>Memoization is a form of caching where the result to an expensive function call is stored and returned. Example: Input: n = 5 Output: 120</p>
<p>Explanation: 5! = 5 × 4 × 3 × 2 × 1 = 120</p>
<p>The program uses a recursive function fact_recursion which caches computed results in a memo array to avoid recalculating factorials for the same numbers.</p>
<p>Time Complexity: O(n) Space Complexity: O(n) </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/git5v" target="_blank">Vedant Mukhedkar</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" 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</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function to run test cases and interact with the user. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on program success </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 69</span> {</div>
<div class="line"><span class="lineno"> 70</span> <span class="comment">// Run test cases</span></div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a>();</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 73</span>}</div>
<div class="ttc" id="afactorial__memoization_8cpp_html_a4243a60d73b9e1296de20196d5b155ba"><div class="ttname"><a href="#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a></div><div class="ttdeci">void test_fact_recursion()</div><div class="ttdoc">Self-test implementations for the fact_recursion function.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00056">factorial_memoization.cpp:56</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a4243a60d73b9e1296de20196d5b155ba" name="a4243a60d73b9e1296de20196d5b155ba"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4243a60d73b9e1296de20196d5b155ba">&#9670;&#160;</a></span>test_fact_recursion()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void test_fact_recursion </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations for the fact_recursion function. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
<div class="line"><span class="lineno"> 57</span> <span class="comment">// Test cases for factorial computation</span></div>
<div class="line"><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(0) == 1);</div>
<div class="line"><span class="lineno"> 59</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(1) == 1);</div>
<div class="line"><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(5) == 120);</div>
<div class="line"><span class="lineno"> 61</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(10) == 3628800);</div>
<div class="line"><span class="lineno"> 62</span> std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 63</span>}</div>
<div class="ttc" id="anamespacemath_html_a73b07abea036f1ce2e3ac5dc169bdb4b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a></div><div class="ttdeci">uint64_t fact_recursion(uint64_t n)</div><div class="ttdoc">Computes the factorial of a non-negative integer using recursion and memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">factorial_memoization.cpp:44</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a name="doc-var-members" id="doc-var-members"></a><h2 id="header-doc-var-members" class="groupheader">Variable Documentation</h2>
<a id="a0f9b4d5fae79e1029daf9bd1b93ec217" name="a0f9b4d5fae79e1029daf9bd1b93ec217"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0f9b4d5fae79e1029daf9bd1b93ec217">&#9670;&#160;</a></span>memo</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::array&lt;uint64_t, 1000&gt; memo {0}</td>
</tr>
</table>
</div><div class="memdoc">
<p>Array to store computed factorials for memoization. </p>
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 31</span>{0};</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a href="../../d2/d96/factorial__memoization_8cpp.html">factorial_memoization.cpp</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.14.0 </li>
</ul>
</div>
</body>
</html>

7
d2/d96/factorial__memoization_8cpp.js Normal file
View File

@@ -0,0 +1,7 @@
var factorial__memoization_8cpp =
[
[ "math::fact_recursion", "dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b", null ],
[ "main", "d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test_fact_recursion", "d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba", null ],
[ "memo", "d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217", null ]
];

174
d2/d96/factorial__memoization_8cpp_source.html Normal file
View File

@@ -0,0 +1,174 @@
<!-- HTML header for doxygen 1.12.0-->
<!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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: math/factorial_memoization.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.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/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</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">
$(function(){initNavTree('d2/d96/factorial__memoization_8cpp_source.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">factorial_memoization.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d2/d96/factorial__memoization_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &lt;iostream&gt;</span> <span class="comment">// for std::cout</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include &lt;cassert&gt;</span> <span class="comment">// For test cases</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include &lt;array&gt;</span> <span class="comment">// For std::array</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include &lt;cstdint&gt;</span> <span class="comment">// For uint64_t</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217"> 31</a></span>std::array&lt;uint64_t, 1000&gt; <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>{0};</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span></div>
<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b"> 44</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a>(uint64_t n) {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 1; <span class="comment">// Base case: 0! = 1</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] != 0) <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n]; <span class="comment">// Return already computed value</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] = n * <a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a>(n - 1); <span class="comment">// Store and return the computed value</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n];</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span>} <span class="comment">// namespace math</span></div>
<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba"> 56</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a>() {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// Test cases for factorial computation</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(0) == 1);</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(1) == 1);</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(5) == 120);</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(10) == 3628800);</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases passed!\n&quot;</span>;</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span>}</div>
</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span></div>
<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 69</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Run test cases</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a>();</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span>}</div>
</div>
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array&lt; uint64_t, 1000 &gt; memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">factorial_memoization.cpp:31</a></div></div>
<div class="ttc" id="afactorial__memoization_8cpp_html_a4243a60d73b9e1296de20196d5b155ba"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a></div><div class="ttdeci">void test_fact_recursion()</div><div class="ttdoc">Self-test implementations for the fact_recursion function.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">factorial_memoization.cpp:56</a></div></div>
<div class="ttc" id="afactorial__memoization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function to run test cases and interact with the user.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">factorial_memoization.cpp:69</a></div></div>
<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
<div class="ttc" id="anamespacemath_html_a73b07abea036f1ce2e3ac5dc169bdb4b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a></div><div class="ttdeci">uint64_t fact_recursion(uint64_t n)</div><div class="ttdoc">Computes the factorial of a non-negative integer using recursion and memoization.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">factorial_memoization.cpp:44</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a href="../../d2/d96/factorial__memoization_8cpp.html">factorial_memoization.cpp</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.14.0 </li>
</ul>
</div>
</body>
</html>

43
d7/d73/abbreviation_8cpp.html
View File

@@ -141,7 +141,7 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
<tr class="memitem:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (std::vector&lt; std::vector&lt; bool &gt; &gt; *<a class="el" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
<tr class="memdesc:add60b8858720bf217df22d992d0fefaa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive Dynamic Programming function. <br /></td></tr>
<tr class="memitem:af53b2f647bee9c5b75ef8dd9ef685dc8" id="r_af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a> (const std::string &amp;str, const std::string &amp;result)</td></tr>
<tr class="memdesc:af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterative Dynamic Programming function. <br /></td></tr>
@@ -200,32 +200,33 @@ Algorithm</h3>
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
<div class="line"><span class="lineno"> 120</span> std::vector&lt;std::vector&lt;bool&gt;&gt; memo(</div>
<div class="line"><span class="lineno"> 120</span> std::vector&lt;std::vector&lt;bool&gt;&gt; <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(</div>
<div class="line"><span class="lineno"> 121</span> str.size() + 1, std::vector&lt;bool&gt;(result.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 122</span> </div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt;= str.size(); ++i) {</div>
<div class="line"><span class="lineno"> 124</span> memo[i][0] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][0] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 125</span> }</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= result.size(); ++i) {</div>
<div class="line"><span class="lineno"> 127</span> memo[0][i] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 127</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[0][i] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 128</span> }</div>
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= str.size(); ++i) {</div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">for</span> (uint32_t j = 1; j &lt;= result.size(); ++j) {</div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
<div class="line"><span class="lineno"> 132</span> memo[i][j] = memo[i - 1][j - 1];</div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1];</div>
<div class="line"><span class="lineno"> 133</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[i - 1] - 32 == result[j - 1]) {</div>
<div class="line"><span class="lineno"> 134</span> memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1] || <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j]);</div>
<div class="line"><span class="lineno"> 135</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (str[i - 1] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[i - 1] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><span class="lineno"> 137</span> memo[i][j] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 137</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 138</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 139</span> memo[i][j] = memo[i - 1][j];</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j];</div>
<div class="line"><span class="lineno"> 140</span> }</div>
<div class="line"><span class="lineno"> 141</span> }</div>
<div class="line"><span class="lineno"> 142</span> }</div>
<div class="line"><span class="lineno"> 143</span> }</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> memo.back().back();</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>.back().back();</div>
<div class="line"><span class="lineno"> 145</span>}</div>
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array&lt; uint64_t, 1000 &gt; memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">factorial_memoization.cpp:31</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -291,7 +292,7 @@ j)</span></li>
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = memo-&gt;at(str_idx).at(result_idx);</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>-&gt;at(str_idx).at(result_idx);</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx == result.size()) {</div>
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 66</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx != result.size()) {</div>
@@ -299,12 +300,12 @@ j)</span></li>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 69</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited-&gt;at(str_idx).at(result_idx)) {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
<div class="line"><span class="lineno"> 82</span> ans = abbreviation_recursion(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 82</span> ans = abbreviation_recursion(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><span class="lineno"> 83</span> str_idx + 1, result_idx + 1);</div>
<div class="line"><span class="lineno"> 84</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[str_idx] - 32 == result[result_idx]) {</div>
<div class="line"><span class="lineno"> 85</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 85</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><span class="lineno"> 86</span> str_idx + 1, result_idx + 1) ||</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><span class="lineno"> 88</span> str_idx + 1, result_idx);</div>
<div class="line"><span class="lineno"> 89</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// if `str[i]` is uppercase, then cannot be converted, return</span></div>
@@ -314,14 +315,14 @@ j)</span></li>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">if</span> (str[str_idx] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[str_idx] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><span class="lineno"> 95</span> ans = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 96</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 97</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 97</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><span class="lineno"> 98</span> str_idx + 1, result_idx);</div>
<div class="line"><span class="lineno"> 99</span> }</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span> }</div>
<div class="line"><span class="lineno"> 102</span> (*memo)[str_idx][result_idx] = ans;</div>
<div class="line"><span class="lineno"> 103</span> (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>)[str_idx][result_idx];</div>
<div class="line"><span class="lineno"> 105</span>}</div>
<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00059">abbreviation.cpp:59</a></div></div>
</div><!-- fragment -->
@@ -383,36 +384,36 @@ j)</span></li>
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 153</span> {</div>
<div class="line"><span class="lineno"> 154</span> std::string s = <span class="stringliteral">&quot;daBcd&quot;</span>, t = <span class="stringliteral">&quot;ABC&quot;</span>;</div>
<div class="line"><span class="lineno"> 155</span> std::vector&lt;std::vector&lt;bool&gt;&gt; memo(s.size() + 1,</div>
<div class="line"><span class="lineno"> 155</span> std::vector&lt;std::vector&lt;bool&gt;&gt; <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(s.size() + 1,</div>
<div class="line"><span class="lineno"> 156</span> std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>)),</div>
<div class="line"><span class="lineno"> 157</span> visited(s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 158</span> </div>
<div class="line"><span class="lineno"> 159</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><span class="lineno"> 160</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 160</span> &amp;<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 161</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 162</span> s = <span class="stringliteral">&quot;XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET&quot;</span>;</div>
<div class="line"><span class="lineno"> 163</span> t = <span class="stringliteral">&quot;XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU&quot;</span>;</div>
<div class="line"><span class="lineno"> 164</span> memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 164</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 165</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 166</span> </div>
<div class="line"><span class="lineno"> 167</span> visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 168</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 169</span> </div>
<div class="line"><span class="lineno"> 170</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><span class="lineno"> 171</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 171</span> &amp;<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 172</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 173</span> </div>
<div class="line"><span class="lineno"> 174</span> s = <span class="stringliteral">&quot;DRFNLZZVHLPZWIupjwdmqafmgkg&quot;</span>;</div>
<div class="line"><span class="lineno"> 175</span> t = <span class="stringliteral">&quot;DRFNLZZVHLPZWI&quot;</span>;</div>
<div class="line"><span class="lineno"> 176</span> </div>
<div class="line"><span class="lineno"> 177</span> memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 178</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 179</span> </div>
<div class="line"><span class="lineno"> 180</span> visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 181</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 182</span> </div>
<div class="line"><span class="lineno"> 183</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><span class="lineno"> 184</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 184</span> &amp;<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 185</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 186</span>}</div>
<div class="ttc" id="aabbreviation_8cpp_html_af53b2f647bee9c5b75ef8dd9ef685dc8"><div class="ttname"><a href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a></div><div class="ttdeci">bool abbreviation(const std::string &amp;str, const std::string &amp;result)</div><div class="ttdoc">Iterative Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00119">abbreviation.cpp:119</a></div></div>

43
d7/d73/abbreviation_8cpp_source.html
View File

@@ -126,11 +126,11 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a> {</div>
<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa"> 59</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(std::vector&lt;std::vector&lt;bool&gt;&gt; *memo,</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa"> 59</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(std::vector&lt;std::vector&lt;bool&gt;&gt; *<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>,</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> std::vector&lt;std::vector&lt;bool&gt;&gt; *visited,</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">const</span> std::string &amp;str, <span class="keyword">const</span> std::string &amp;result,</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> uint32_t str_idx = 0, uint32_t result_idx = 0) {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = memo-&gt;at(str_idx).at(result_idx);</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>-&gt;at(str_idx).at(result_idx);</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx == result.size()) {</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx != result.size()) {</div>
@@ -138,12 +138,12 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited-&gt;at(str_idx).at(result_idx)) {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> str_idx + 1, result_idx + 1);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[str_idx] - 32 == result[result_idx]) {</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> str_idx + 1, result_idx + 1) ||</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> str_idx + 1, result_idx);</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// if `str[i]` is uppercase, then cannot be converted, return</span></div>
@@ -153,44 +153,44 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">if</span> (str[str_idx] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[str_idx] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> ans = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> str_idx + 1, result_idx);</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> (*memo)[str_idx][result_idx] = ans;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>)[str_idx][result_idx];</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span></div>
<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8"> 119</a></span><span class="keywordtype">bool</span> <a class="code hl_namespace" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a>(<span class="keyword">const</span> std::string &amp;str, <span class="keyword">const</span> std::string &amp;result) {</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::vector&lt;std::vector&lt;bool&gt;&gt; memo(</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::vector&lt;std::vector&lt;bool&gt;&gt; <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> str.size() + 1, std::vector&lt;bool&gt;(result.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt;= str.size(); ++i) {</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> memo[i][0] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][0] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= result.size(); ++i) {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> memo[0][i] = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[0][i] = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= str.size(); ++i) {</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">for</span> (uint32_t j = 1; j &lt;= result.size(); ++j) {</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> memo[i][j] = memo[i - 1][j - 1];</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1];</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[i - 1] - 32 == result[j - 1]) {</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1] || <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j]);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span> (str[i - 1] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[i - 1] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> memo[i][j] = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> memo[i][j] = memo[i - 1][j];</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j];</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> }</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> }</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> }</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> memo.back().back();</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>.back().back();</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span>}</div>
</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span>} <span class="comment">// namespace abbreviation</span></div>
@@ -199,36 +199,36 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 153</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> std::string s = <span class="stringliteral">&quot;daBcd&quot;</span>, t = <span class="stringliteral">&quot;ABC&quot;</span>;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector&lt;std::vector&lt;bool&gt;&gt; memo(s.size() + 1,</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector&lt;std::vector&lt;bool&gt;&gt; <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(s.size() + 1,</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>)),</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> visited(s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> &amp;<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> s = <span class="stringliteral">&quot;XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET&quot;</span>;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> t = <span class="stringliteral">&quot;XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU&quot;</span>;</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> &amp;<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">false</span>);</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> s = <span class="stringliteral">&quot;DRFNLZZVHLPZWIupjwdmqafmgkg&quot;</span>;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> t = <span class="stringliteral">&quot;DRFNLZZVHLPZWI&quot;</span>;</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> &amp;<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span>}</div>
</div>
@@ -243,6 +243,7 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">abbreviation.cpp:59</a></div></div>
<div class="ttc" id="aabbreviation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00192">abbreviation.cpp:192</a></div></div>
<div class="ttc" id="aabbreviation_8cpp_html_af53b2f647bee9c5b75ef8dd9ef685dc8"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a></div><div class="ttdeci">bool abbreviation(const std::string &amp;str, const std::string &amp;result)</div><div class="ttdoc">Iterative Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">abbreviation.cpp:119</a></div></div>
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array&lt; uint64_t, 1000 &gt; memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">factorial_memoization.cpp:31</a></div></div>
<div class="ttc" id="anamespaceabbreviation_html"><div class="ttname"><a href="../../d0/df8/namespaceabbreviation.html">abbreviation</a></div><div class="ttdoc">Functions for Abbreviation implementation.</div></div>
<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
</div><!-- fragment --></div><!-- contents -->

11
db/d30/factorial__memoization_8cpp__incl.map Normal file
View File

@@ -0,0 +1,11 @@
<map id="math/factorial_memoization.cpp" name="math/factorial_memoization.cpp">
<area shape="rect" id="Node000001" title="Factorial calculation using recursion and memoization" alt="" coords="70,5,276,31"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,77,105"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="152,34,78,74,75,69,149,29"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="101,79,165,105"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="169,33,149,67,145,64,164,30"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="189,79,240,105"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="182,30,202,64,197,67,178,33"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="264,79,324,105"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="195,29,262,68,259,73,192,34"/>
</map>

1
db/d30/factorial__memoization_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
69fc891120320fb84e290bfcf9cb1ff5

119
db/d30/factorial__memoization_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,119 @@
<?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 13.1.2 (20250808.2320)
-->
<!-- Title: math/factorial_memoization.cpp Pages: 1 -->
<svg width="247pt" height="83pt"
viewBox="0.00 0.00 247.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.5)">
<title>math/factorial_memoization.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Factorial calculation using recursion and memoization">
<polygon fill="#999999" stroke="#666666" points="203.12,-74.5 48.38,-74.5 48.38,-55.25 203.12,-55.25 203.12,-74.5"/>
<text xml:space="preserve" text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/factorial_memoization.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.96,-54.84C93.74,-46.66 71.05,-34.46 53.37,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.42,-22.07 44.96,-20.42 52.11,-28.24 55.42,-22.07"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 71.62,-19.25 71.62,0 119.88,0 119.88,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="95.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.8,-55.08C116.87,-48.11 111.24,-38.12 106.31,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="109.51,-27.92 101.55,-20.93 103.41,-31.36 109.51,-27.92"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="175.62,-19.25 137.88,-19.25 137.88,0 175.62,0 175.62,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="156.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M130.87,-55.08C134.93,-48.11 140.74,-38.12 145.84,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.75,-31.32 150.76,-20.92 142.7,-27.8 148.75,-31.32"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="239.38,-19.25 194.12,-19.25 194.12,0 239.38,0 239.38,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M141.19,-54.84C154.91,-46.81 175.25,-34.91 191.37,-25.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="193.07,-28.54 199.93,-20.47 189.53,-22.5 193.07,-28.54"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.7 KiB

93
db/d30/factorial__memoization_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,93 @@
<?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 13.1.2 (20250808.2320)
-->
<!-- Title: math/factorial_memoization.cpp Pages: 1 -->
<svg width="247pt" height="83pt"
viewBox="0.00 0.00 247.00 83.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.5)">
<title>math/factorial_memoization.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Factorial calculation using recursion and memoization">
<polygon fill="#999999" stroke="#666666" points="203.12,-74.5 48.38,-74.5 48.38,-55.25 203.12,-55.25 203.12,-74.5"/>
<text xml:space="preserve" text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/factorial_memoization.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.96,-54.84C93.74,-46.66 71.05,-34.46 53.37,-24.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.42,-22.07 44.96,-20.42 52.11,-28.24 55.42,-22.07"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 71.62,-19.25 71.62,0 119.88,0 119.88,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="95.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.8,-55.08C116.87,-48.11 111.24,-38.12 106.31,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="109.51,-27.92 101.55,-20.93 103.41,-31.36 109.51,-27.92"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="175.62,-19.25 137.88,-19.25 137.88,0 175.62,0 175.62,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="156.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M130.87,-55.08C134.93,-48.11 140.74,-38.12 145.84,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.75,-31.32 150.76,-20.92 142.7,-27.8 148.75,-31.32"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="239.38,-19.25 194.12,-19.25 194.12,0 239.38,0 239.38,-19.25"/>
<text xml:space="preserve" text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M141.19,-54.84C154.91,-46.81 175.25,-34.91 191.37,-25.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="193.07,-28.54 199.93,-20.47 189.53,-22.5 193.07,-28.54"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.0 KiB

40
dd/d47/namespacemath.html
View File

@@ -174,6 +174,8 @@ Functions</h2></td></tr>
<tr class="memdesc:ac37d3ba52eb296597d7a024ba8c4a5a5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate Euler's Totient. <br /></td></tr>
<tr class="memitem:a7e78996673df791014cfe540b183456a" id="r_a7e78996673df791014cfe540b183456a"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7e78996673df791014cfe540b183456a">factorial</a> (uint8_t n)</td></tr>
<tr class="memdesc:a7e78996673df791014cfe540b183456a"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to find factorial of given number <br /></td></tr>
<tr class="memitem:a73b07abea036f1ce2e3ac5dc169bdb4b" id="r_a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a> (uint64_t n)</td></tr>
<tr class="memdesc:a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the factorial of a non-negative integer using recursion and memoization. <br /></td></tr>
<tr class="memitem:aec65db4e5c7317323227f026fe50ef11" id="r_aec65db4e5c7317323227f026fe50ef11"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aec65db4e5c7317323227f026fe50ef11">integral_approx</a> (double lb, double ub, const std::function&lt; double(double)&gt; &amp;func, double delta=.0001)</td></tr>
<tr class="memdesc:aec65db4e5c7317323227f026fe50ef11"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes integral approximation. <br /></td></tr>
<tr class="memitem:a50936ee98f4d40f17823befc65a32aec" id="r_a50936ee98f4d40f17823befc65a32aec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a50936ee98f4d40f17823befc65a32aec">test_eval</a> (double approx, double expected, double threshold)</td></tr>
@@ -245,8 +247,8 @@ Functions</h2></td></tr>
<p>std::cout</p>
<p>for IO implementations</p>
<p>Evaluate recurrence relation using <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">matrix exponentiation</a>.</p>
<p>Math algorithms.</p>
<p>for mathematical functions</p>
<p>Math algorithms.</p>
<p>Mathematical algorithms.</p>
<p>for IO operations</p>
<p>for M_PI definition and pow()</p>
@@ -819,6 +821,42 @@ template&lt;typename T&gt; </div>
</div><!-- fragment -->
</div>
</div>
<a id="a73b07abea036f1ce2e3ac5dc169bdb4b" name="a73b07abea036f1ce2e3ac5dc169bdb4b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a73b07abea036f1ce2e3ac5dc169bdb4b">&#9670;&#160;</a></span>fact_recursion()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">uint64_t math::fact_recursion </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Computes the factorial of a non-negative integer using recursion and memoization. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>The integer whose factorial is to be computed </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The factorial of n </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 44</span> {</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 1; <span class="comment">// Base case: 0! = 1</span></div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] != 0) <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n]; <span class="comment">// Return already computed value</span></div>
<div class="line"><span class="lineno"> 47</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] = n * <a class="code hl_function" href="#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a>(n - 1); <span class="comment">// Store and return the computed value</span></div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n];</div>
<div class="line"><span class="lineno"> 49</span>}</div>
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array&lt; uint64_t, 1000 &gt; memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">factorial_memoization.cpp:31</a></div></div>
<div class="ttc" id="anamespacemath_html_a73b07abea036f1ce2e3ac5dc169bdb4b"><div class="ttname"><a href="#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a></div><div class="ttdeci">uint64_t fact_recursion(uint64_t n)</div><div class="ttdoc">Computes the factorial of a non-negative integer using recursion and memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">factorial_memoization.cpp:44</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a7e78996673df791014cfe540b183456a" name="a7e78996673df791014cfe540b183456a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7e78996673df791014cfe540b183456a">&#9670;&#160;</a></span>factorial()</h2>

1
dd/d47/namespacemath.js
View File

@@ -14,6 +14,7 @@ var namespacemath =
[ "cylinder_surface_area", "dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864", null ],
[ "cylinder_surface_perimeter", "dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73", null ],
[ "cylinder_volume", "dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca", null ],
[ "fact_recursion", "dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b", null ],
[ "factorial", "dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a", null ],
[ "hemi_sphere_surface_area", "dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb", null ],
[ "integral_approx", "dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11", null ],

2
dir_296d53ceaeaa7e099814a6def439fe8a.html
View File

@@ -148,6 +148,8 @@ Files</h2></td></tr>
<tr class="memdesc:d9/d5d/extended__euclid__algorithm_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) <br /></td></tr>
<tr class="memitem:factorial_2Ecpp" id="r_factorial_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d00/factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d00/factorial_8cpp.html">factorial.cpp</a></td></tr>
<tr class="memdesc:d9/d00/factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number. <br /></td></tr>
<tr class="memitem:factorial_5Fmemoization_2Ecpp" id="r_factorial_5Fmemoization_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/d96/factorial__memoization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d96/factorial__memoization_8cpp.html">factorial_memoization.cpp</a></td></tr>
<tr class="memdesc:d2/d96/factorial__memoization_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a> <br /></td></tr>
<tr class="memitem:fast_5Fpower_2Ecpp" id="r_fast_5Fpower_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d0b/fast__power_8cpp.html">fast_power.cpp</a></td></tr>
<tr class="memdesc:d2/d0b/fast__power_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Faster computation for \(a^b\). <br /></td></tr>
<tr class="memitem:fibonacci_2Ecpp" id="r_fibonacci_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d89/fibonacci_8cpp.html">fibonacci.cpp</a></td></tr>

1
dir_296d53ceaeaa7e099814a6def439fe8a.js
View File

@@ -15,6 +15,7 @@ var dir_296d53ceaeaa7e099814a6def439fe8a =
[ "eulers_totient_function.cpp", "da/d23/eulers__totient__function_8cpp.html", "da/d23/eulers__totient__function_8cpp" ],
[ "extended_euclid_algorithm.cpp", "d9/d5d/extended__euclid__algorithm_8cpp.html", "d9/d5d/extended__euclid__algorithm_8cpp" ],
[ "factorial.cpp", "d9/d00/factorial_8cpp.html", "d9/d00/factorial_8cpp" ],
[ "factorial_memoization.cpp", "d2/d96/factorial__memoization_8cpp.html", "d2/d96/factorial__memoization_8cpp" ],
[ "fast_power.cpp", "d2/d0b/fast__power_8cpp.html", "d2/d0b/fast__power_8cpp" ],
[ "fibonacci.cpp", "d9/d89/fibonacci_8cpp.html", "d9/d89/fibonacci_8cpp" ],
[ "fibonacci_fast.cpp", "d4/d32/fibonacci__fast_8cpp.html", "d4/d32/fibonacci__fast_8cpp" ],

6
doxygen_crawl.html
View File

@@ -485,6 +485,11 @@
<a href="d2/d90/namespacegreedy__algorithms.html"/>
<a href="d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502"/>
<a href="d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098"/>
<a href="d2/d96/factorial__memoization_8cpp.html"/>
<a href="d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217"/>
<a href="d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba"/>
<a href="d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d2/d96/factorial__memoization_8cpp_source.html"/>
<a href="d2/d96/sparse__table__range__queries_8cpp_source.html"/>
<a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html"/>
<a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e"/>
@@ -2837,6 +2842,7 @@
<a href="dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f"/>
<a href="dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca"/>
<a href="dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967"/>
<a href="dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b"/>
<a href="dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a"/>
<a href="dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b"/>
<a href="dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb"/>

91
files.html
View File

@@ -315,54 +315,55 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_14_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d23/eulers__totient__function_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> @description Euler Totient Function is also known as phi function </td></tr>
<tr id="row_14_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d5d/extended__euclid__algorithm_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
<tr id="row_14_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d00/factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number </td></tr>
<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) +
<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d96/factorial__memoization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d96/factorial__memoization_8cpp.html" target="_self">factorial_memoization.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a> </td></tr>
<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) +
\mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
<tr id="row_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
<tr id="row_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
<tr id="row_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) +
<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
<tr id="row_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
<tr id="row_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
<tr id="row_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) +
\mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>linear_recurrence_matrix.cpp</b></td><td class="desc"></td></tr>
<tr id="row_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
<tr id="row_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
<tr id="row_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0 </td></tr>
<tr id="row_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
<tr id="row_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log
<tr id="row_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><b>linear_recurrence_matrix.cpp</b></td><td class="desc"></td></tr>
<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
<tr id="row_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
<tr id="row_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
<tr id="row_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0 </td></tr>
<tr id="row_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log
N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
<tr id="row_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
<tr id="row_14_58_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
<tr id="row_14_59_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
<tr id="row_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
<tr id="row_14_58_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
<tr id="row_14_59_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
<tr id="row_14_60_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
<tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="dynsection.toggleFolder('15_')"><span class="arrowhead closed"></span></span><span id="img_15_" class="iconfolder" onclick="dynsection.toggleFolder('15_')"><div class="folder-icon"></div></span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d9c/babylonian__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="dc/d9c/babylonian__method_8cpp.html" target="_self">babylonian_method.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d6a/bisection__method_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> </td></tr>

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

1
globals_func_t.html
View File

@@ -139,6 +139,7 @@ $(function(){initNavTree('globals_func_t.html','',''); });
<li>test_contains()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">binary_search_tree2.cpp</a></li>
<li>test_double()&#160;:&#160;<a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">quick_sort_3.cpp</a></li>
<li>test_f()&#160;:&#160;<a class="el" href="d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">shell_sort2.cpp</a></li>
<li>test_fact_recursion()&#160;:&#160;<a class="el" href="d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">factorial_memoization.cpp</a></li>
<li>test_find_max()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">binary_search_tree2.cpp</a></li>
<li>test_find_min()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">binary_search_tree2.cpp</a></li>
<li>test_function()&#160;:&#160;<a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a></li>

3
globals_m.html
View File

File diff suppressed because one or more lines are too long

1
globals_t.html
View File

@@ -139,6 +139,7 @@ $(function(){initNavTree('globals_t.html','',''); });
<li>test_contains()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">binary_search_tree2.cpp</a></li>
<li>test_double()&#160;:&#160;<a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">quick_sort_3.cpp</a></li>
<li>test_f()&#160;:&#160;<a class="el" href="d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">shell_sort2.cpp</a></li>
<li>test_fact_recursion()&#160;:&#160;<a class="el" href="d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">factorial_memoization.cpp</a></li>
<li>test_find_max()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">binary_search_tree2.cpp</a></li>
<li>test_find_min()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">binary_search_tree2.cpp</a></li>
<li>test_function()&#160;:&#160;<a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a></li>

1
globals_vars.html
View File

@@ -130,6 +130,7 @@ $(function(){initNavTree('globals_vars.html','',''); });
<li>MAX_ITER&#160;:&#160;<a class="el" href="d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">adaline_learning.cpp</a></li>
<li>MAX_ITERATIONS&#160;:&#160;<a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">newton_raphson_method.cpp</a></li>
<li>max_size&#160;:&#160;<a class="el" href="d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">queue_using_array.cpp</a></li>
<li>memo&#160;:&#160;<a class="el" href="d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">factorial_memoization.cpp</a></li>
<li>prime&#160;:&#160;<a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a></li>
<li>prime_numbers&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_factorization.cpp</a></li>
<li>stack&#160;:&#160;<a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">paranthesis_matching.cpp</a></li>

1
namespacemembers_f.html
View File

@@ -116,6 +116,7 @@ $(function(){initNavTree('namespacemembers_f.html','',''); });
<div class="textblock">Here is a list of all documented namespace members with links to the namespaces they belong to:</div>
<h3 class="doxsection"><a id="index_f" name="index_f"></a>- f -</h3><ul>
<li>fact_recursion()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math</a></li>
<li>factorial()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math</a></li>
<li>FastFourierTransform()&#160;:&#160;<a class="el" href="d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods</a></li>
<li>find()&#160;:&#160;<a class="el" href="d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing</a></li>

1
namespacemembers_func_f.html
View File

@@ -116,6 +116,7 @@ $(function(){initNavTree('namespacemembers_func_f.html','',''); });
<div class="textblock">Here is a list of all documented namespace functions with links to the namespaces they belong to:</div>
<h3 class="doxsection"><a id="index_f" name="index_f"></a>- f -</h3><ul>
<li>fact_recursion()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math</a></li>
<li>factorial()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math</a></li>
<li>FastFourierTransform()&#160;:&#160;<a class="el" href="d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods</a></li>
<li>find()&#160;:&#160;<a class="el" href="d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing</a></li>

24
navtreedata.js
View File

@@ -137,18 +137,18 @@ var NAVTREEINDEX =
[
"annotated.html",
"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028",
"d3/d17/namespaceutil__functions.html",
"d4/d90/classdata__structures_1_1_skip_list.html",
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04",
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933",
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e",
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352",
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95",
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b",
"dc/d53/classtests_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2",
"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864",
"de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147",
"files.html"
"d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe",
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html",
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425",
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8",
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5",
"d8/dfa/median__search2_8cpp_source.html",
"da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155",
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7",
"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9",
"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656",
"de/dc3/fibonacci__sum_8cpp_source.html",
"dir_e3380d2178455503f266746fb14246a5.html"
];
var SYNCONMSG = 'click to disable panel synchronization';

46
navtreeindex0.js
View File

@@ -13,10 +13,10 @@ var NAVTREEINDEX0 =
"d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad":[10,0,17,21,4],
"d0/d01/smallest__circle_8cpp_source.html":[10,0,17,21],
"d0/d05/classvector_1_1iterator.html":[9,0,71,2],
"d0/d08/realtime__stats_8cpp.html":[10,0,14,52],
"d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[10,0,14,52,5],
"d0/d08/realtime__stats_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,52,4],
"d0/d08/realtime__stats_8cpp_source.html":[10,0,14,52],
"d0/d08/realtime__stats_8cpp.html":[10,0,14,53],
"d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[10,0,14,53,5],
"d0/d08/realtime__stats_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,53,4],
"d0/d08/realtime__stats_8cpp_source.html":[10,0,14,53],
"d0/d20/namespaceground__to__ground__projectile__motion.html":[8,0,43],
"d0/d2b/namespacequick__sort.html":[8,0,98],
"d0/d2e/namespaceneural__network.html":[8,0,85],
@@ -40,12 +40,12 @@ var NAVTREEINDEX0 =
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,2,14,1],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[8,0,21,7,2],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,2,14,2],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[10,0,14,21],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1":[10,0,14,21,0],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300":[10,0,14,21,2],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49":[10,0,14,21,1],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,21,3],
"d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html":[10,0,14,21],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[10,0,14,22],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1":[10,0,14,22,0],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300":[10,0,14,22,2],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49":[10,0,14,22,1],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,22,3],
"d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html":[10,0,14,22],
"d0/d51/approximate__pi_8cpp.html":[10,0,14,1],
"d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,1,3],
"d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,1,2],
@@ -90,10 +90,10 @@ var NAVTREEINDEX0 =
"d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560":[8,0,26,2],
"d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[8,0,26,7],
"d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d":[8,0,26,8],
"d0/d6d/modular__exponentiation_8cpp.html":[10,0,14,38],
"d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,38,2],
"d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,38,0],
"d0/d6d/modular__exponentiation_8cpp_source.html":[10,0,14,38],
"d0/d6d/modular__exponentiation_8cpp.html":[10,0,14,39],
"d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,39,2],
"d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,39,0],
"d0/d6d/modular__exponentiation_8cpp_source.html":[10,0,14,39],
"d0/d6f/namespaceothers.html":[8,0,88],
"d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec":[8,0,88,2],
"d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703":[8,0,88,1],
@@ -101,11 +101,11 @@ var NAVTREEINDEX0 =
"d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,6,18,2],
"d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,18,1],
"d0/d77/longest__palindromic__subsequence_8cpp_source.html":[10,0,6,18],
"d0/da2/number__of__positive__divisors_8cpp.html":[10,0,14,44],
"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,44,2],
"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[10,0,14,44,1],
"d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,44,0],
"d0/da2/number__of__positive__divisors_8cpp_source.html":[10,0,14,44],
"d0/da2/number__of__positive__divisors_8cpp.html":[10,0,14,45],
"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,45,2],
"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[10,0,14,45,1],
"d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,45,0],
"d0/da2/number__of__positive__divisors_8cpp_source.html":[10,0,14,45],
"d0/da4/namespacemonte__carlo.html":[8,0,78],
"d0/db6/non__recursive__merge__sort_8cpp.html":[10,0,23,20],
"d0/db6/non__recursive__merge__sort_8cpp.html#a140d913e42fb94176a0b2c8b29a80420":[10,0,23,20,1],
@@ -128,10 +128,10 @@ var NAVTREEINDEX0 =
"d0/dea/strassen__matrix__multiplication_8cpp_source.html":[10,0,5,1],
"d0/df8/namespaceabbreviation.html":[8,0,1],
"d0/dff/structlinkedlist.html":[9,0,42],
"d1/d11/gcd__of__n__numbers_8cpp.html":[10,0,14,23],
"d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,23,4],
"d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,23,3],
"d1/d11/gcd__of__n__numbers_8cpp_source.html":[10,0,14,23],
"d1/d11/gcd__of__n__numbers_8cpp.html":[10,0,14,24],
"d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,24,4],
"d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,24,3],
"d1/d11/gcd__of__n__numbers_8cpp_source.html":[10,0,14,24],
"d1/d12/tree_8cpp_source.html":[10,0,4,35],
"d1/d1b/classpriority__queue.html":[9,0,52],
"d1/d1b/classpriority__queue.html#a4df2ae826d2b2caf4a6755adbd34a836":[9,0,52,0],

36
navtreeindex1.js
View File

@@ -28,10 +28,10 @@ var NAVTREEINDEX1 =
"d1/daa/random__pivot__quick__sort_8cpp_source.html":[10,0,23,30],
"d1/db3/structcompare.html":[9,0,28],
"d1/db6/namespaceknight__tour.html":[8,0,59],
"d1/dbb/n__choose__r_8cpp.html":[10,0,14,42],
"d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,42,2],
"d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,42,0],
"d1/dbb/n__choose__r_8cpp_source.html":[10,0,14,42],
"d1/dbb/n__choose__r_8cpp.html":[10,0,14,43],
"d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,43,2],
"d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,43,0],
"d1/dbb/n__choose__r_8cpp_source.html":[10,0,14,43],
"d1/dbe/lu__decomposition_8h.html":[10,0,15,12],
"d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f":[10,0,15,12,1],
"d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509":[10,0,15,12,2],
@@ -54,9 +54,9 @@ var NAVTREEINDEX1 =
"d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150":[8,0,86,1],
"d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309":[8,0,86,0],
"d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93":[8,0,86,2],
"d1/de9/integral__approximation_8cpp.html":[10,0,14,25],
"d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,25,1],
"d1/de9/integral__approximation_8cpp_source.html":[10,0,14,25],
"d1/de9/integral__approximation_8cpp.html":[10,0,14,26],
"d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,26,1],
"d1/de9/integral__approximation_8cpp_source.html":[10,0,14,26],
"d1/ded/windowed__median_8cpp.html":[10,0,19,6],
"d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601":[10,0,19,6,2],
"d1/ded/windowed__median_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,19,6,1],
@@ -108,11 +108,11 @@ var NAVTREEINDEX1 =
"d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e":[9,0,46,8],
"d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913":[9,0,46,11],
"d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82":[9,0,46,5],
"d2/d0b/fast__power_8cpp.html":[10,0,14,15],
"d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d":[10,0,14,15,0],
"d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445":[10,0,14,15,1],
"d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,15,2],
"d2/d0b/fast__power_8cpp_source.html":[10,0,14,15],
"d2/d0b/fast__power_8cpp.html":[10,0,14,16],
"d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d":[10,0,14,16,0],
"d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445":[10,0,14,16,1],
"d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,16,2],
"d2/d0b/fast__power_8cpp_source.html":[10,0,14,16],
"d2/d0f/classstats__computer1.html":[9,0,62],
"d2/d0f/classstats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,62,3],
"d2/d0f/classstats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,62,4],
@@ -188,6 +188,11 @@ var NAVTREEINDEX1 =
"d2/d90/namespacegreedy__algorithms.html":[8,0,42],
"d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[8,0,42,4],
"d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098":[8,0,42,5],
"d2/d96/factorial__memoization_8cpp.html":[10,0,14,15],
"d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217":[10,0,14,15,3],
"d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba":[10,0,14,15,2],
"d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,15,1],
"d2/d96/factorial__memoization_8cpp_source.html":[10,0,14,15],
"d2/d96/sparse__table__range__queries_8cpp_source.html":[10,0,20,6],
"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html":[9,0,13,1,1],
"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e":[9,0,13,1,1,1],
@@ -244,10 +249,5 @@ var NAVTREEINDEX1 =
"d3/d05/sudoku__solver_8cpp_source.html":[10,0,0,11],
"d3/d06/ode__semi__implicit__euler_8cpp.html":[10,0,15,17],
"d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[10,0,15,17,1],
"d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[10,0,15,17,3],
"d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[10,0,15,17,2],
"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[10,0,15,17,0],
"d3/d06/ode__semi__implicit__euler_8cpp_source.html":[10,0,15,17],
"d3/d09/node_8hpp.html":[10,0,4,15],
"d3/d09/node_8hpp_source.html":[10,0,4,15]
"d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[10,0,15,17,3]
};

60
navtreeindex10.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX10 =
{
"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[9,0,21,0,9],
"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[8,0,128,0,0],
"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[9,0,21,0,0],
"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[8,0,128,0,14],
"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[9,0,21,0,14],
"dc/d53/classtests_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[8,0,128,0,2],
"dc/d53/classtests_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[9,0,21,0,2],
"dc/d53/classtests_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[8,0,128,0,10],
@@ -214,40 +219,35 @@ var NAVTREEINDEX10 =
"dd/d43/namespace_m_d5.html":[8,0,70],
"dd/d47/namespacemath.html":[8,0,69],
"dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85":[8,0,69,0],
"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[8,0,69,21],
"dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3":[8,0,69,26],
"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[8,0,69,22],
"dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3":[8,0,69,27],
"dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73":[8,0,69,12],
"dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a":[8,0,69,19],
"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[8,0,69,45],
"dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb":[8,0,69,15],
"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[8,0,69,38],
"dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3":[8,0,69,44],
"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[8,0,69,35],
"dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a":[8,0,69,20],
"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[8,0,69,46],
"dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb":[8,0,69,16],
"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[8,0,69,39],
"dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3":[8,0,69,45],
"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[8,0,69,36],
"dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[8,0,69,7],
"dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[8,0,69,5],
"dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[8,0,69,34],
"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[8,0,69,42],
"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[8,0,69,25],
"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[8,0,69,17],
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[8,0,69,23],
"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a":[8,0,69,14],
"dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[8,0,69,35],
"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[8,0,69,43],
"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[8,0,69,26],
"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[8,0,69,18],
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[8,0,69,24],
"dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b":[8,0,69,14],
"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a":[8,0,69,15],
"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[8,0,69,9],
"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[8,0,69,29],
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[8,0,69,22],
"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[8,0,69,30],
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[8,0,69,23],
"dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec":[8,0,69,3],
"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[8,0,69,36],
"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[8,0,69,40],
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[8,0,69,31],
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[8,0,69,39],
"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[8,0,69,24],
"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[8,0,69,32],
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[8,0,69,33],
"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[8,0,69,37],
"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[8,0,69,41],
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[8,0,69,32],
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[8,0,69,40],
"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[8,0,69,25],
"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[8,0,69,33],
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[8,0,69,34],
"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[8,0,69,1],
"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[8,0,69,43],
"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[8,0,69,37],
"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[8,0,69,8],
"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[8,0,69,18],
"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[8,0,69,13],
"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[8,0,69,2],
"dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[8,0,69,27]
"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[8,0,69,44]
};

54
navtreeindex11.js
View File

@@ -1,14 +1,20 @@
var NAVTREEINDEX11 =
{
"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[8,0,69,38],
"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[8,0,69,8],
"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[8,0,69,19],
"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[8,0,69,13],
"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[8,0,69,2],
"dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[8,0,69,28],
"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[8,0,69,11],
"dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[8,0,69,30],
"dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[8,0,69,31],
"dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953":[8,0,69,6],
"dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[8,0,69,4],
"dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[8,0,69,10],
"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[8,0,69,16],
"dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a":[8,0,69,41],
"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[8,0,69,20],
"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[8,0,69,28],
"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[8,0,69,17],
"dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a":[8,0,69,42],
"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[8,0,69,21],
"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[8,0,69,29],
"dd/d4f/class_solution.html":[9,0,59],
"dd/d51/classvector_1_1const__reverse__iterator.html":[9,0,71,1],
"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[8,0,122,0,0],
@@ -165,11 +171,11 @@ var NAVTREEINDEX11 =
"de/d36/namespacen__bonacci.html":[8,0,80],
"de/d40/shell__sort_8cpp_source.html":[10,0,23,34],
"de/d41/namespacekaratsuba__algorithm.html":[8,0,57],
"de/d47/string__fibonacci_8cpp.html":[10,0,14,55],
"de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35":[10,0,14,55,0],
"de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[10,0,14,55,1],
"de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,55,2],
"de/d47/string__fibonacci_8cpp_source.html":[10,0,14,55],
"de/d47/string__fibonacci_8cpp.html":[10,0,14,56],
"de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35":[10,0,14,56,0],
"de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[10,0,14,56,1],
"de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,56,2],
"de/d47/string__fibonacci_8cpp_source.html":[10,0,14,56],
"de/d48/struct_trie_1_1_trie_node.html":[9,0,67,0],
"de/d4a/class_compare.html":[9,0,27],
"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[9,0,27,0],
@@ -219,20 +225,20 @@ var NAVTREEINDEX11 =
"de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,0,1],
"de/d99/aliquot__sum_8cpp_source.html":[10,0,14,0],
"de/d9b/namespacegray__code.html":[8,0,41],
"de/d9b/prime__numbers_8cpp.html":[10,0,14,49],
"de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a":[10,0,14,49,1],
"de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,49,0],
"de/d9b/prime__numbers_8cpp_source.html":[10,0,14,49],
"de/d9b/prime__numbers_8cpp.html":[10,0,14,50],
"de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a":[10,0,14,50,1],
"de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,50,0],
"de/d9b/prime__numbers_8cpp_source.html":[10,0,14,50],
"de/d9d/classdata__structures_1_1linked__list_1_1link.html":[9,0,2,0,0],
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb":[9,0,2,0,0,0],
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936":[9,0,2,0,0,4],
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11":[9,0,2,0,0,2],
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3":[9,0,2,0,0,1],
"de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081":[9,0,2,0,0,3],
"de/dab/ncr__modulo__p_8cpp.html":[10,0,14,43],
"de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,43,4],
"de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422":[10,0,14,43,1],
"de/dab/ncr__modulo__p_8cpp_source.html":[10,0,14,43],
"de/dab/ncr__modulo__p_8cpp.html":[10,0,14,44],
"de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,44,4],
"de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422":[10,0,14,44,1],
"de/dab/ncr__modulo__p_8cpp_source.html":[10,0,14,44],
"de/db3/namespaceatbash.html":[8,0,3],
"de/db4/namespacedisjoint__union.html":[8,0,23],
"de/db6/a1z26__cipher_8cpp.html":[10,0,2,0],
@@ -241,13 +247,7 @@ var NAVTREEINDEX11 =
"de/db6/a1z26__cipher_8cpp_source.html":[10,0,2,0],
"de/dc3/binaryheap_8cpp.html":[10,0,4,4],
"de/dc3/binaryheap_8cpp_source.html":[10,0,4,4],
"de/dc3/fibonacci__sum_8cpp.html":[10,0,14,20],
"de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,20,5],
"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,20,1],
"de/dc3/fibonacci__sum_8cpp_source.html":[10,0,14,20],
"de/dc5/intersection__of__two__arrays_8cpp.html":[10,0,16,6],
"de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,6,5],
"de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,6,2],
"de/dc5/intersection__of__two__arrays_8cpp_source.html":[10,0,16,6],
"de/dcd/kadanes3_8cpp.html":[10,0,17,8]
"de/dc3/fibonacci__sum_8cpp.html":[10,0,14,21],
"de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,21,5],
"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,21,1]
};

48
navtreeindex12.js
View File

@@ -1,5 +1,11 @@
var NAVTREEINDEX12 =
{
"de/dc3/fibonacci__sum_8cpp_source.html":[10,0,14,21],
"de/dc5/intersection__of__two__arrays_8cpp.html":[10,0,16,6],
"de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,6,5],
"de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,6,2],
"de/dc5/intersection__of__two__arrays_8cpp_source.html":[10,0,16,6],
"de/dcd/kadanes3_8cpp.html":[10,0,17,8],
"de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147":[10,0,17,8,1],
"de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,17,8,2],
"de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,8,0],
@@ -37,9 +43,9 @@ var NAVTREEINDEX12 =
"de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,9,15,4],
"de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,9,15,3],
"de/dde/lowest__common__ancestor_8cpp_source.html":[10,0,9,15],
"de/de4/fibonacci__large_8cpp.html":[10,0,14,18],
"de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db":[10,0,14,18,0],
"de/de4/fibonacci__large_8cpp_source.html":[10,0,14,18],
"de/de4/fibonacci__large_8cpp.html":[10,0,14,19],
"de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db":[10,0,14,19,0],
"de/de4/fibonacci__large_8cpp_source.html":[10,0,14,19],
"de/df6/classgreedy__algorithms_1_1_binary_addition.html":[8,0,42,2],
"de/df6/classgreedy__algorithms_1_1_binary_addition.html":[9,0,7,1],
"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2":[8,0,42,2,1],
@@ -104,19 +110,19 @@ var NAVTREEINDEX12 =
"df/d47/stack_8hpp.html":[10,0,4,27],
"df/d47/stack_8hpp_source.html":[10,0,4,27],
"df/d4a/namespaceselection__sort__recursive.html":[8,0,107],
"df/d66/vector__cross__product_8cpp.html":[10,0,14,58],
"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,58,3],
"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,58,2],
"df/d66/vector__cross__product_8cpp_source.html":[10,0,14,58],
"df/d66/vector__cross__product_8cpp.html":[10,0,14,59],
"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,59,3],
"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,59,2],
"df/d66/vector__cross__product_8cpp_source.html":[10,0,14,59],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html":[8,0,13,0],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2":[8,0,13,0,4],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[8,0,13,0,3],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[8,0,13,0,2],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830":[8,0,13,0,1],
"df/d72/modular__division_8cpp.html":[10,0,14,37],
"df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,37,3],
"df/d72/modular__division_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,37,0],
"df/d72/modular__division_8cpp_source.html":[10,0,14,37],
"df/d72/modular__division_8cpp.html":[10,0,14,38],
"df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,38,3],
"df/d72/modular__division_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,38,0],
"df/d72/modular__division_8cpp_source.html":[10,0,14,38],
"df/d74/namespacesubarray__sum.html":[8,0,123],
"df/d76/namespacefibonacci.html":[8,0,31],
"df/d82/breadth__first__search_8cpp.html":[10,0,9,1],
@@ -214,12 +220,12 @@ var NAVTREEINDEX12 =
"df/dee/class_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,39,5],
"df/dee/class_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,39,4],
"df/dee/class_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,39,0],
"df/def/power__for__huge__numbers_8cpp.html":[10,0,14,46],
"df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[10,0,14,46,0],
"df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9":[10,0,14,46,2],
"df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f":[10,0,14,46,3],
"df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,46,1],
"df/def/power__for__huge__numbers_8cpp_source.html":[10,0,14,46],
"df/def/power__for__huge__numbers_8cpp.html":[10,0,14,47],
"df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[10,0,14,47,0],
"df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9":[10,0,14,47,2],
"df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f":[10,0,14,47,3],
"df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,47,1],
"df/def/power__for__huge__numbers_8cpp_source.html":[10,0,14,47],
"df/dfb/minimax_8cpp.html":[10,0,0,4],
"df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,4,0],
"df/dfb/minimax_8cpp_source.html":[10,0,0,4],
@@ -243,11 +249,5 @@ var NAVTREEINDEX12 =
"dir_9c6faab82c22511b50177aa2e38e2780.html":[10,0,15],
"dir_bb1b521853a9c46347182a9d10420771.html":[10,0,23],
"dir_c11585dfcef32a26e29098facab6c144.html":[10,0,0],
"dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[10,0,3],
"dir_e3380d2178455503f266746fb14246a5.html":[10,0,8],
"dir_e79632891301b850df87e9c0030293fa.html":[10,0,10],
"dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[10,0,12],
"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[10,0,4,0],
"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[10,0,1],
"examples.html":[11]
"dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[10,0,3]
};

6
navtreeindex13.js
View File

@@ -1,5 +1,11 @@
var NAVTREEINDEX13 =
{
"dir_e3380d2178455503f266746fb14246a5.html":[10,0,8],
"dir_e79632891301b850df87e9c0030293fa.html":[10,0,10],
"dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[10,0,12],
"dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[10,0,4,0],
"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[10,0,1],
"examples.html":[11],
"files.html":[10,0],
"functions.html":[9,3,0],
"functions.html":[9,3,0,0],

80
navtreeindex2.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX2 =
{
"d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[10,0,15,17,2],
"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[10,0,15,17,0],
"d3/d06/ode__semi__implicit__euler_8cpp_source.html":[10,0,15,17],
"d3/d09/node_8hpp.html":[10,0,4,15],
"d3/d09/node_8hpp_source.html":[10,0,4,15],
"d3/d17/namespaceutil__functions.html":[8,0,134],
"d3/d19/sparse__matrix_8cpp.html":[10,0,17,22],
"d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,17,22,0],
@@ -153,10 +158,10 @@ var NAVTREEINDEX2 =
"d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,24,3,3],
"d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,24,3,2],
"d3/dfe/horspool_8cpp_source.html":[10,0,24,3],
"d3/dfe/perimeter_8cpp.html":[10,0,14,45],
"d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,45,8],
"d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,45,3],
"d3/dfe/perimeter_8cpp_source.html":[10,0,14,45],
"d3/dfe/perimeter_8cpp.html":[10,0,14,46],
"d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,46,8],
"d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,46,3],
"d3/dfe/perimeter_8cpp_source.html":[10,0,14,46],
"d4/d08/sha256_8cpp.html":[10,0,12,6],
"d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,6,5],
"d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27":[10,0,12,6,8],
@@ -171,28 +176,28 @@ var NAVTREEINDEX2 =
"d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[10,0,15,3,4],
"d4/d18/composite__simpson__rule_8cpp_source.html":[10,0,15,3],
"d4/d1c/namespacehamming__distance.html":[8,0,44],
"d4/d21/least__common__multiple_8cpp.html":[10,0,14,33],
"d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,33,3],
"d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563":[10,0,14,33,0],
"d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25":[10,0,14,33,1],
"d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,33,2],
"d4/d21/least__common__multiple_8cpp_source.html":[10,0,14,33],
"d4/d32/fibonacci__fast_8cpp.html":[10,0,14,17],
"d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f":[10,0,14,17,0],
"d4/d32/fibonacci__fast_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,17,2],
"d4/d32/fibonacci__fast_8cpp.html#abebd72fcda852381644b55f9316719a0":[10,0,14,17,3],
"d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,17,1],
"d4/d32/fibonacci__fast_8cpp_source.html":[10,0,14,17],
"d4/d21/least__common__multiple_8cpp.html":[10,0,14,34],
"d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,34,3],
"d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563":[10,0,14,34,0],
"d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25":[10,0,14,34,1],
"d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,34,2],
"d4/d21/least__common__multiple_8cpp_source.html":[10,0,14,34],
"d4/d32/fibonacci__fast_8cpp.html":[10,0,14,18],
"d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f":[10,0,14,18,0],
"d4/d32/fibonacci__fast_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,18,2],
"d4/d32/fibonacci__fast_8cpp.html#abebd72fcda852381644b55f9316719a0":[10,0,14,18,3],
"d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,18,1],
"d4/d32/fibonacci__fast_8cpp_source.html":[10,0,14,18],
"d4/d32/inorder__successor__of__bst_8cpp.html":[10,0,16,5],
"d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,16,5,11],
"d4/d32/inorder__successor__of__bst_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,16,5,7],
"d4/d32/inorder__successor__of__bst_8cpp_source.html":[10,0,16,5],
"d4/d38/namespacecount__bits__flip.html":[8,0,15],
"d4/d38/power__of__two_8cpp.html":[10,0,14,47],
"d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,47,2],
"d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc":[10,0,14,47,3],
"d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,47,0],
"d4/d38/power__of__two_8cpp_source.html":[10,0,14,47],
"d4/d38/power__of__two_8cpp.html":[10,0,14,48],
"d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,48,2],
"d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc":[10,0,14,48,3],
"d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,48,0],
"d4/d38/power__of__two_8cpp_source.html":[10,0,14,48],
"d4/d39/group__open__addressing.html":[7,0],
"d4/d3e/k__nearest__neighbors_8cpp.html":[10,0,13,2],
"d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,13,2,3],
@@ -201,10 +206,10 @@ var NAVTREEINDEX2 =
"d4/d3e/n__queens_8cpp.html":[10,0,0,5],
"d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,5,1],
"d4/d3e/n__queens_8cpp_source.html":[10,0,0,5],
"d4/d45/gcd__recursive__euclidean_8cpp.html":[10,0,14,24],
"d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[10,0,14,24,0],
"d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,24,1],
"d4/d45/gcd__recursive__euclidean_8cpp_source.html":[10,0,14,24],
"d4/d45/gcd__recursive__euclidean_8cpp.html":[10,0,14,25],
"d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[10,0,14,25,0],
"d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,25,1],
"d4/d45/gcd__recursive__euclidean_8cpp_source.html":[10,0,14,25],
"d4/d48/hamming__distance_8cpp.html":[10,0,1,5],
"d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,5,4],
"d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,5,3],
@@ -231,23 +236,18 @@ var NAVTREEINDEX2 =
"d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e":[10,0,23,35,9],
"d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246":[10,0,23,35,6],
"d4/d7a/shell__sort2_8cpp_source.html":[10,0,23,35],
"d4/d83/sum__of__digits_8cpp.html":[10,0,14,57],
"d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0":[10,0,14,57,4],
"d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[10,0,14,57,3],
"d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395":[10,0,14,57,1],
"d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[10,0,14,57,2],
"d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,57,0],
"d4/d83/sum__of__digits_8cpp_source.html":[10,0,14,57],
"d4/d86/large__number_8h.html":[10,0,14,30],
"d4/d86/large__number_8h_source.html":[10,0,14,30],
"d4/d83/sum__of__digits_8cpp.html":[10,0,14,58],
"d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0":[10,0,14,58,4],
"d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[10,0,14,58,3],
"d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395":[10,0,14,58,1],
"d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[10,0,14,58,2],
"d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,58,0],
"d4/d83/sum__of__digits_8cpp_source.html":[10,0,14,58],
"d4/d86/large__number_8h.html":[10,0,14,31],
"d4/d86/large__number_8h_source.html":[10,0,14,31],
"d4/d8b/gray__code_8cpp_source.html":[10,0,1,4],
"d4/d8d/jarvis__algorithm_8cpp.html":[10,0,8,2],
"d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,8,2,3],
"d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,8,2,2],
"d4/d8d/jarvis__algorithm_8cpp_source.html":[10,0,8,2],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html":[10,0,1,9],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,9,1],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,9,0],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html":[10,0,1,9],
"d4/d90/classdata__structures_1_1_skip_list.html":[8,0,21,5]
"d4/d8d/jarvis__algorithm_8cpp_source.html":[10,0,8,2]
};

54
navtreeindex3.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX3 =
{
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html":[10,0,1,9],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,9,1],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,9,0],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html":[10,0,1,9],
"d4/d90/classdata__structures_1_1_skip_list.html":[8,0,21,5],
"d4/d90/classdata__structures_1_1_skip_list.html":[9,0,2,12],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[8,0,21,5,7],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[9,0,2,12,7],
@@ -18,23 +23,23 @@ var NAVTREEINDEX3 =
"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[8,0,21,5,5],
"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,2,12,5],
"d4/d91/namespacevector__cross.html":[8,0,136],
"d4/d9c/primes__up__to__billion_8cpp.html":[10,0,14,50],
"d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[10,0,14,50,1],
"d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[10,0,14,50,2],
"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,50,0],
"d4/d9c/primes__up__to__billion_8cpp_source.html":[10,0,14,50],
"d4/d9d/sum__of__binomial__coefficient_8cpp.html":[10,0,14,56],
"d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,56,2],
"d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,56,1],
"d4/d9d/sum__of__binomial__coefficient_8cpp_source.html":[10,0,14,56],
"d4/d9c/primes__up__to__billion_8cpp.html":[10,0,14,51],
"d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[10,0,14,51,1],
"d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[10,0,14,51,2],
"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,51,0],
"d4/d9c/primes__up__to__billion_8cpp_source.html":[10,0,14,51],
"d4/d9d/sum__of__binomial__coefficient_8cpp.html":[10,0,14,57],
"d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,57,2],
"d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,57,1],
"d4/d9d/sum__of__binomial__coefficient_8cpp_source.html":[10,0,14,57],
"d4/d9f/selection__sort__recursive_8cpp.html":[10,0,23,33],
"d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,33,3],
"d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,33,1],
"d4/d9f/selection__sort__recursive_8cpp_source.html":[10,0,23,33],
"d4/da0/gcd__iterative__euclidean_8cpp.html":[10,0,14,22],
"d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[10,0,14,22,0],
"d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,22,1],
"d4/da0/gcd__iterative__euclidean_8cpp_source.html":[10,0,14,22],
"d4/da0/gcd__iterative__euclidean_8cpp.html":[10,0,14,23],
"d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[10,0,14,23,0],
"d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,23,1],
"d4/da0/gcd__iterative__euclidean_8cpp_source.html":[10,0,14,23],
"d4/da0/kadane_8cpp.html":[10,0,6,13],
"d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,13,0],
"d4/da0/kadane_8cpp_source.html":[10,0,6,13],
@@ -175,15 +180,15 @@ var NAVTREEINDEX3 =
"d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,9,5],
"d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,9,2],
"d5/d67/complex__numbers_8cpp_source.html":[10,0,14,9],
"d5/d7a/largest__power_8cpp.html":[10,0,14,31],
"d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,31,2],
"d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,31,1],
"d5/d7a/largest__power_8cpp_source.html":[10,0,14,31],
"d5/d7a/largest__power_8cpp.html":[10,0,14,32],
"d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,32,2],
"d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,32,1],
"d5/d7a/largest__power_8cpp_source.html":[10,0,14,32],
"d5/d82/edit__distance_8cpp_source.html":[10,0,6,8],
"d5/d83/lcm__sum_8cpp.html":[10,0,14,32],
"d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,32,2],
"d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,32,1],
"d5/d83/lcm__sum_8cpp_source.html":[10,0,14,32],
"d5/d83/lcm__sum_8cpp.html":[10,0,14,33],
"d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,33,2],
"d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,33,1],
"d5/d83/lcm__sum_8cpp_source.html":[10,0,14,33],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html":[4],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46":[4,0],
"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[4,1],
@@ -244,10 +249,5 @@ var NAVTREEINDEX3 =
"d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331":[8,0,113,17],
"d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd":[8,0,113,15],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[8,0,21,0,0],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[9,0,2,5,0],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[8,0,21,0,0,19],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[9,0,2,5,0,19],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[8,0,21,0,0,17],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[9,0,2,5,0,17],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[8,0,21,0,0,15]
"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[9,0,2,5,0]
};

48
navtreeindex4.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX4 =
{
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[8,0,21,0,0,19],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[9,0,2,5,0,19],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[8,0,21,0,0,17],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[9,0,2,5,0,17],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[8,0,21,0,0,15],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[9,0,2,5,0,15],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[8,0,21,0,0,0],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[9,0,2,5,0,0],
@@ -136,11 +141,11 @@ var NAVTREEINDEX4 =
"d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[10,0,2,3,3],
"d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,2,3,2],
"d6/d2c/caesar__cipher_8cpp_source.html":[10,0,2,3],
"d6/d2d/modular__inverse__simple_8cpp.html":[10,0,14,40],
"d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6":[10,0,14,40,0],
"d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,40,2],
"d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,40,1],
"d6/d2d/modular__inverse__simple_8cpp_source.html":[10,0,14,40],
"d6/d2d/modular__inverse__simple_8cpp.html":[10,0,14,41],
"d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6":[10,0,14,41,0],
"d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,41,2],
"d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,41,1],
"d6/d2d/modular__inverse__simple_8cpp_source.html":[10,0,14,41],
"d6/d2e/fenwick__tree_8cpp.html":[10,0,20,0],
"d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,20,0,2],
"d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,20,0,1],
@@ -171,14 +176,14 @@ var NAVTREEINDEX4 =
"d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,1,3,2],
"d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,1,3,1],
"d6/d38/find__non__repeating__number_8cpp_source.html":[10,0,1,3],
"d6/d42/miller__rabin_8cpp.html":[10,0,14,36],
"d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb":[10,0,14,36,4],
"d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506":[10,0,14,36,2],
"d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,36,5],
"d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce":[10,0,14,36,1],
"d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29":[10,0,14,36,3],
"d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,36,0],
"d6/d42/miller__rabin_8cpp_source.html":[10,0,14,36],
"d6/d42/miller__rabin_8cpp.html":[10,0,14,37],
"d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb":[10,0,14,37,4],
"d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506":[10,0,14,37,2],
"d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[10,0,14,37,5],
"d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce":[10,0,14,37,1],
"d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29":[10,0,14,37,3],
"d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,37,0],
"d6/d42/miller__rabin_8cpp_source.html":[10,0,14,37],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[8,0,13,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[9,0,1,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[8,0,13,0,0,0],
@@ -234,20 +239,15 @@ var NAVTREEINDEX4 =
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[9,0,8,0,0,0],
"d6/d84/namespaceutils.html":[8,0,135],
"d6/d8d/namespacemorse.html":[8,0,79],
"d6/d9d/large__factorial_8cpp.html":[10,0,14,29],
"d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[10,0,14,29,0],
"d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8":[10,0,14,29,1],
"d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa":[10,0,14,29,2],
"d6/d9d/large__factorial_8cpp_source.html":[10,0,14,29],
"d6/d9d/large__factorial_8cpp.html":[10,0,14,30],
"d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[10,0,14,30,0],
"d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8":[10,0,14,30,1],
"d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa":[10,0,14,30,2],
"d6/d9d/large__factorial_8cpp_source.html":[10,0,14,30],
"d6/da2/namespacevigenere.html":[8,0,137],
"d6/da9/odd__even__sort_8cpp_source.html":[10,0,23,22],
"d6/dab/namespacetree__234.html":[8,0,131],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html":[9,0,13,2,0],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c":[9,0,13,2,0,7],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893":[9,0,13,2,0,8],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8":[9,0,13,2,0,5],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4":[9,0,13,2,0,0],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154":[9,0,13,2,0,6],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2":[9,0,13,2,0,3],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602":[9,0,13,2,0,4]
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893":[9,0,13,2,0,8]
};

24
navtreeindex5.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX5 =
{
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8":[9,0,13,2,0,5],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4":[9,0,13,2,0,0],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154":[9,0,13,2,0,6],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2":[9,0,13,2,0,3],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602":[9,0,13,2,0,4],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933":[9,0,13,2,0,2],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c":[9,0,13,2,0,9],
"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53":[9,0,13,2,0,1],
@@ -12,12 +17,12 @@ var NAVTREEINDEX5 =
"d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,19,2,5],
"d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc":[10,0,19,2,2],
"d6/db0/binomial__dist_8cpp_source.html":[10,0,19,2],
"d6/db8/inv__sqrt_8cpp.html":[10,0,14,27],
"d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97":[10,0,14,27,2],
"d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,27,3],
"d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52":[10,0,14,27,0],
"d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,27,1],
"d6/db8/inv__sqrt_8cpp_source.html":[10,0,14,27],
"d6/db8/inv__sqrt_8cpp.html":[10,0,14,28],
"d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97":[10,0,14,28,2],
"d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,28,3],
"d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52":[10,0,14,28,0],
"d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,28,1],
"d6/db8/inv__sqrt_8cpp_source.html":[10,0,14,28],
"d6/dba/jump__game_8cpp.html":[10,0,11,6],
"d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,11,6,2],
"d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,11,6,1],
@@ -244,10 +249,5 @@ var NAVTREEINDEX5 =
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06":[8,0,88,0,2,1],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06":[9,0,13,0,2,1],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[8,0,88,0,2,0],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[9,0,13,0,2,0],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[8,0,88,0,2,12],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[9,0,13,0,2,12],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[8,0,88,0,2,6],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[9,0,13,0,2,6],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[8,0,88,0,2,3]
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[9,0,13,0,2,0]
};

28
navtreeindex6.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX6 =
{
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[8,0,88,0,2,12],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[9,0,13,0,2,12],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[8,0,88,0,2,6],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[9,0,13,0,2,6],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[8,0,88,0,2,3],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[9,0,13,0,2,3],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[8,0,88,0,2,4],
"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[9,0,13,0,2,4],
@@ -19,10 +24,10 @@ var NAVTREEINDEX6 =
"d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280":[8,0,34,0,5],
"d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214":[8,0,34,0,2],
"d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b":[8,0,34,0,6],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html":[10,0,14,39],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,39,4],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,39,2],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html":[10,0,14,39],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html":[10,0,14,40],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,40,4],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,40,2],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html":[10,0,14,40],
"d8/d61/radix__sort2_8cpp.html":[10,0,23,29],
"d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,23,29,3],
"d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,29,0],
@@ -209,10 +214,10 @@ var NAVTREEINDEX6 =
"d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,7,2],
"d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,7,1],
"d8/dd5/check__factorial_8cpp_source.html":[10,0,14,7],
"d8/ddf/sieve__of__eratosthenes_8cpp.html":[10,0,14,53],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,53,3],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,53,0],
"d8/ddf/sieve__of__eratosthenes_8cpp_source.html":[10,0,14,53],
"d8/ddf/sieve__of__eratosthenes_8cpp.html":[10,0,14,54],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,54,3],
"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,54,0],
"d8/ddf/sieve__of__eratosthenes_8cpp_source.html":[10,0,14,54],
"d8/dee/avltree_8cpp.html":[10,0,4,1],
"d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b":[10,0,4,1,6],
"d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6":[10,0,4,1,7],
@@ -244,10 +249,5 @@ var NAVTREEINDEX6 =
"d8/df2/classadaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,22,6],
"d8/dfa/median__search2_8cpp.html":[10,0,22,11],
"d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,22,11,3],
"d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,22,11,1],
"d8/dfa/median__search2_8cpp_source.html":[10,0,22,11],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html":[9,0,12,2,1],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3":[9,0,12,2,1,0],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256":[9,0,12,2,1,3],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f":[9,0,12,2,1,1]
"d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,22,11,1]
};

28
navtreeindex7.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX7 =
{
"d8/dfa/median__search2_8cpp_source.html":[10,0,22,11],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html":[9,0,12,2,1],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3":[9,0,12,2,1,0],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256":[9,0,12,2,1,3],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f":[9,0,12,2,1,1],
"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352":[9,0,12,2,1,2],
"d9/d00/factorial_8cpp.html":[10,0,14,14],
"d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,14,2],
@@ -76,10 +81,10 @@ var NAVTREEINDEX7 =
"d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,15,10,2],
"d9/d37/inverse__fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,15,10,1],
"d9/d37/inverse__fast__fourier__transform_8cpp_source.html":[10,0,15,10],
"d9/d44/magic__number_8cpp.html":[10,0,14,35],
"d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,35,2],
"d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,35,1],
"d9/d44/magic__number_8cpp_source.html":[10,0,14,35],
"d9/d44/magic__number_8cpp.html":[10,0,14,36],
"d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[10,0,14,36,2],
"d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,36,1],
"d9/d44/magic__number_8cpp_source.html":[10,0,14,36],
"d9/d49/kohonen__som__trace_8cpp.html":[7,1,2],
"d9/d49/structdata__structures_1_1_node.html":[8,0,21,3],
"d9/d49/structdata__structures_1_1_node.html":[9,0,2,10],
@@ -128,10 +133,10 @@ var NAVTREEINDEX7 =
"d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,27,0],
"d9/d80/trapped__rainwater_8cpp_source.html":[10,0,6,27],
"d9/d85/selection__sort__iterative_8cpp_source.html":[10,0,23,32],
"d9/d89/fibonacci_8cpp.html":[10,0,14,16],
"d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,16,2],
"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,16,1],
"d9/d89/fibonacci_8cpp_source.html":[10,0,14,16],
"d9/d89/fibonacci_8cpp.html":[10,0,14,17],
"d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,17,2],
"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,17,1],
"d9/d89/fibonacci_8cpp_source.html":[10,0,14,17],
"d9/d90/struct_btree.html":[9,0,24],
"d9/d92/chaining_8cpp.html":[10,0,12,0],
"d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,0,1],
@@ -244,10 +249,5 @@ var NAVTREEINDEX7 =
"da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c":[10,0,6,14,1],
"da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561":[10,0,6,14,5],
"da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5":[10,0,6,14,2],
"da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541":[10,0,6,14,4],
"da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155":[10,0,6,14,7],
"da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,14,3],
"da/d0d/longest__common__string_8cpp_source.html":[10,0,6,14],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html":[9,0,12,0,1],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[9,0,12,0,1,0]
"da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541":[10,0,6,14,4]
};

80
navtreeindex8.js
View File

@@ -1,13 +1,18 @@
var NAVTREEINDEX8 =
{
"da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155":[10,0,6,14,7],
"da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,14,3],
"da/d0d/longest__common__string_8cpp_source.html":[10,0,6,14],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html":[9,0,12,0,1],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[9,0,12,0,1,0],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[9,0,12,0,1,1],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[9,0,12,0,1,2],
"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77":[9,0,12,0,1,3],
"da/d18/quadratic__equations__complex__numbers_8cpp.html":[10,0,14,51],
"da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,51,3],
"da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,51,1],
"da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a":[10,0,14,51,0],
"da/d18/quadratic__equations__complex__numbers_8cpp_source.html":[10,0,14,51],
"da/d18/quadratic__equations__complex__numbers_8cpp.html":[10,0,14,52],
"da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,52,3],
"da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,52,1],
"da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a":[10,0,14,52,0],
"da/d18/quadratic__equations__complex__numbers_8cpp_source.html":[10,0,14,52],
"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html":[9,0,14,0,0],
"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a":[9,0,14,0,0,1],
"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2":[9,0,14,0,0,7],
@@ -25,10 +30,10 @@ var NAVTREEINDEX8 =
"da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,12,2],
"da/d23/eulers__totient__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,12,0],
"da/d23/eulers__totient__function_8cpp_source.html":[10,0,14,12],
"da/d24/sqrt__double_8cpp.html":[10,0,14,54],
"da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc":[10,0,14,54,1],
"da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,54,0],
"da/d24/sqrt__double_8cpp_source.html":[10,0,14,54],
"da/d24/sqrt__double_8cpp.html":[10,0,14,55],
"da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc":[10,0,14,55,1],
"da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,55,0],
"da/d24/sqrt__double_8cpp_source.html":[10,0,14,55],
"da/d27/prim_8cpp_source.html":[10,0,9,18],
"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html":[9,0,2,3,0],
"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039":[9,0,2,3,0,0],
@@ -36,10 +41,10 @@ var NAVTREEINDEX8 =
"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e":[9,0,2,3,0,1],
"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81":[9,0,2,3,0,4],
"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635":[9,0,2,3,0,3],
"da/d39/volume_8cpp.html":[10,0,14,59],
"da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,59,7],
"da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,59,3],
"da/d39/volume_8cpp_source.html":[10,0,14,59],
"da/d39/volume_8cpp.html":[10,0,14,60],
"da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,60,7],
"da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,60,3],
"da/d39/volume_8cpp_source.html":[10,0,14,60],
"da/d41/uint128__t_8hpp.html":[10,0,2,7],
"da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3":[10,0,2,7,5],
"da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57":[10,0,2,7,4],
@@ -151,11 +156,11 @@ var NAVTREEINDEX8 =
"da/dc3/linked__list_8cpp.html":[10,0,4,11],
"da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,4,11,3],
"da/dc3/linked__list_8cpp_source.html":[10,0,4,11],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html":[10,0,14,19],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,19,2],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[10,0,14,19,0],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,19,1],
"da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html":[10,0,14,19],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html":[10,0,14,20],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,20,2],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[10,0,14,20,0],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,20,1],
"da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html":[10,0,14,20],
"da/dd1/structquadratic__probing_1_1_entry.html":[8,0,96,0],
"da/dd1/structquadratic__probing_1_1_entry.html":[9,0,15,0],
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[8,0,96,0,1],
@@ -207,14 +212,14 @@ var NAVTREEINDEX8 =
"db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,24,2,2],
"db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,24,2,1],
"db/d09/duval_8cpp_source.html":[10,0,24,2],
"db/d0d/prime__factorization_8cpp.html":[10,0,14,48],
"db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46":[10,0,14,48,1],
"db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23":[10,0,14,48,4],
"db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b":[10,0,14,48,3],
"db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,48,0],
"db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe":[10,0,14,48,5],
"db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099":[10,0,14,48,2],
"db/d0d/prime__factorization_8cpp_source.html":[10,0,14,48],
"db/d0d/prime__factorization_8cpp.html":[10,0,14,49],
"db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46":[10,0,14,49,1],
"db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23":[10,0,14,49,4],
"db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b":[10,0,14,49,3],
"db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,49,0],
"db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe":[10,0,14,49,5],
"db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099":[10,0,14,49,2],
"db/d0d/prime__factorization_8cpp_source.html":[10,0,14,49],
"db/d16/0__1__knapsack_8cpp.html":[10,0,6,0],
"db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,6,0,2],
"db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,6,0,0],
@@ -225,10 +230,10 @@ var NAVTREEINDEX8 =
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,9,0,0],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[8,0,61,0,1],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,9,0,1],
"db/d27/n__bonacci_8cpp.html":[10,0,14,41],
"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,41,2],
"db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,41,0],
"db/d27/n__bonacci_8cpp_source.html":[10,0,14,41],
"db/d27/n__bonacci_8cpp.html":[10,0,14,42],
"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,42,2],
"db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,42,0],
"db/d27/n__bonacci_8cpp_source.html":[10,0,14,42],
"db/d3c/tower__of__hanoi_8cpp.html":[10,0,17,25],
"db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed":[10,0,17,25,3],
"db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417":[10,0,17,25,4],
@@ -239,15 +244,10 @@ var NAVTREEINDEX8 =
"db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,23,41,1],
"db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,23,41,0],
"db/d3f/wave__sort_8cpp_source.html":[10,0,23,41],
"db/d40/integral__approximation2_8cpp.html":[10,0,14,26],
"db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,26,3],
"db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,26,2],
"db/d40/integral__approximation2_8cpp_source.html":[10,0,14,26],
"db/d40/integral__approximation2_8cpp.html":[10,0,14,27],
"db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,27,3],
"db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,27,2],
"db/d40/integral__approximation2_8cpp_source.html":[10,0,14,27],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html":[9,0,2,4,0],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[9,0,2,4,0,4],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[9,0,2,4,0,3],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[9,0,2,4,0,0],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[9,0,2,4,0,2],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[9,0,2,4,0,6],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[9,0,2,4,0,1]
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[9,0,2,4,0,4]
};

22
navtreeindex9.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX9 =
{
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[9,0,2,4,0,3],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[9,0,2,4,0,0],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[9,0,2,4,0,2],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[9,0,2,4,0,6],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[9,0,2,4,0,1],
"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b":[9,0,2,4,0,5],
"db/d66/struct_item.html":[9,0,40],
"db/d6b/kelvin__to__celsius_8cpp.html":[10,0,17,9],
@@ -120,10 +125,10 @@ var NAVTREEINDEX9 =
"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[9,0,68,7],
"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[9,0,68,26],
"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[9,0,68,34],
"db/d9f/iterative__factorial_8cpp.html":[10,0,14,28],
"db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,28,2],
"db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,28,1],
"db/d9f/iterative__factorial_8cpp_source.html":[10,0,14,28],
"db/d9f/iterative__factorial_8cpp.html":[10,0,14,29],
"db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[10,0,14,29,2],
"db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,14,29,1],
"db/d9f/iterative__factorial_8cpp_source.html":[10,0,14,29],
"db/da9/classqueue.html":[9,0,55],
"db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368":[9,0,55,2],
"db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d":[9,0,55,7],
@@ -221,7 +226,7 @@ var NAVTREEINDEX9 =
"dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a":[10,0,13,6,1],
"dc/d38/ordinary__least__squares__regressor_8cpp_source.html":[10,0,13,6],
"dc/d3a/namespacesubset__sum.html":[8,0,125],
"dc/d52/linear__recurrence__matrix_8cpp_source.html":[10,0,14,34],
"dc/d52/linear__recurrence__matrix_8cpp_source.html":[10,0,14,35],
"dc/d53/classtests_1_1_circular_linked_list.html":[8,0,128,0],
"dc/d53/classtests_1_1_circular_linked_list.html":[9,0,21,0],
"dc/d53/classtests_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42":[8,0,128,0,13],
@@ -244,10 +249,5 @@ var NAVTREEINDEX9 =
"dc/d53/classtests_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13":[9,0,21,0,15],
"dc/d53/classtests_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[8,0,128,0,8],
"dc/d53/classtests_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[9,0,21,0,8],
"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[8,0,128,0,9],
"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[9,0,21,0,9],
"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[8,0,128,0,0],
"dc/d53/classtests_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[9,0,21,0,0],
"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[8,0,128,0,14],
"dc/d53/classtests_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[9,0,21,0,14]
"dc/d53/classtests_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[8,0,128,0,9]
};

121
search/all_12.js
View File

File diff suppressed because one or more lines are too long

175
search/all_19.js
View File

File diff suppressed because one or more lines are too long

140
search/all_b.js
View File

@@ -3,73 +3,75 @@ var searchData=
['f_0',['f',['../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397',1,'numerical_methods::simpson_method::f()'],['../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226',1,'numerical_methods::midpoint_rule::f()']]],
['fac_1',['fac',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec',1,'math::ncr_modulo_p::NCRModuloP']]],
['fact_2',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]],
['factorial_3',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
['factorial_2ecpp_4',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]],
['factors_5',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]],
['false_5fposition_6',['false_position',['../df/dea/namespacefalse__position.html',1,'']]],
['false_5fposition_2ecpp_7',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]],
['fast_5ffourier_5ftransform_2ecpp_8',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]],
['fast_5finteger_5finput_2ecpp_9',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]],
['fast_5finvsqrt_10',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
['fast_5fpower_2ecpp_11',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]],
['fast_5fpower_5flinear_12',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
['fast_5fpower_5frecursive_13',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
['fastfouriertransform_14',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
['fastinput_15',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
['fcfs_16',['FCFS',['../dd/dca/class_f_c_f_s.html',1,'']]],
['fcfs_5fscheduling_2ecpp_17',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]],
['features_18',['Features',['../index.html#autotoc_md104',1,'']]],
['fenwick_5ftree_19',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries::fenwick_tree'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
['fenwick_5ftree_2ecpp_20',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]],
['fib_21',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
['fib_5faccurate_22',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
['fib_5fb_23',['fib_b',['../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de',1,'matrix_exponentiation.cpp']]],
['fibo_24',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
['fibonacci_25',['fibonacci',['../df/d76/namespacefibonacci.html',1,'fibonacci'],['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci::fibonacci()']]],
['fibonacci_2ecpp_26',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]],
['fibonacci_5ffast_2ecpp_27',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]],
['fibonacci_5flarge_2ecpp_28',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]],
['fibonacci_5fmatrix_5fexponentiation_2ecpp_29',['fibonacci_matrix_exponentiation.cpp',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html',1,'']]],
['fibonacci_5fsearch_30',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
['fibonacci_5fsearch_2ecpp_31',['fibonacci_search.cpp',['../de/d0d/fibonacci__search_8cpp.html',1,'']]],
['fibonacci_5fsum_32',['fibonacci_sum',['../d3/dc9/namespacefibonacci__sum.html',1,'']]],
['fibonacci_5fsum_2ecpp_33',['fibonacci_sum.cpp',['../de/dc3/fibonacci__sum_8cpp.html',1,'']]],
['fibosum_34',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
['file_20name_20guidelines_35',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]],
['fill_36',['fill',['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'decimal_to_roman_numeral.cpp']]],
['find_37',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
['find_38',['find',['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
['find_5fmax_39',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
['find_5fmin_40',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
['find_5fnon_5frepeating_5finteger_41',['find_non_repeating_integer',['../d2/da7/namespacefind__non__repeating__integer.html',1,'find_non_repeating_integer'],['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer::find_non_repeating_integer()']]],
['find_5fnon_5frepeating_5fnumber_2ecpp_42',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]],
['find_5fpat_5fin_5ftext_43',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
['find_5fset_44',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
['find_5fzero_45',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_46',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_47',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_48',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
['findminimumedge_49',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
['findminindex_50',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
['findminnode_51',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['findnextgap_52',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
['findparent_53',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
['findset_54',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
['findshifttable_55',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
['first_56',['first',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1',1,'data_structures::linked_list::list']]],
['first_5ftest_57',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
['fit_58',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit()'],['../d8/df2/classadaline.html#a74e3c6c037b67895014414c5d75465e5',1,'adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d8/df2/classadaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)']]],
['fit_5ffrom_5fcsv_59',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
['fit_5fols_5fregressor_60',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
['floyd_5fcycle_5fdetection_5falgo_2ecpp_61',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]],
['for_20reviewers_20and_20maintainers_62',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
['formatter_63',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]],
['forward_64',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node']]],
['forward_5feuler_65',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
['forward_5feuler_5fstep_66',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
['freenode_67',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
['freq_5fmap_68',['freq_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2',1,'others::Cache::LFUCache']]],
['from_20the_20root_20node_69',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
['front_70',['front',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]],
['full_71',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]]
['fact_5frecursion_3',['fact_recursion',['../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b',1,'math']]],
['factorial_4',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
['factorial_2ecpp_5',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]],
['factorial_5fmemoization_2ecpp_6',['factorial_memoization.cpp',['../d2/d96/factorial__memoization_8cpp.html',1,'']]],
['factors_7',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]],
['false_5fposition_8',['false_position',['../df/dea/namespacefalse__position.html',1,'']]],
['false_5fposition_2ecpp_9',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]],
['fast_5ffourier_5ftransform_2ecpp_10',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]],
['fast_5finteger_5finput_2ecpp_11',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]],
['fast_5finvsqrt_12',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
['fast_5fpower_2ecpp_13',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]],
['fast_5fpower_5flinear_14',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
['fast_5fpower_5frecursive_15',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
['fastfouriertransform_16',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
['fastinput_17',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
['fcfs_18',['FCFS',['../dd/dca/class_f_c_f_s.html',1,'']]],
['fcfs_5fscheduling_2ecpp_19',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]],
['features_20',['Features',['../index.html#autotoc_md104',1,'']]],
['fenwick_5ftree_21',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries::fenwick_tree'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
['fenwick_5ftree_2ecpp_22',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]],
['fib_23',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
['fib_5faccurate_24',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
['fib_5fb_25',['fib_b',['../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de',1,'matrix_exponentiation.cpp']]],
['fibo_26',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
['fibonacci_27',['fibonacci',['../df/d76/namespacefibonacci.html',1,'fibonacci'],['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci::fibonacci()']]],
['fibonacci_2ecpp_28',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]],
['fibonacci_5ffast_2ecpp_29',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]],
['fibonacci_5flarge_2ecpp_30',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]],
['fibonacci_5fmatrix_5fexponentiation_2ecpp_31',['fibonacci_matrix_exponentiation.cpp',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html',1,'']]],
['fibonacci_5fsearch_32',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
['fibonacci_5fsearch_2ecpp_33',['fibonacci_search.cpp',['../de/d0d/fibonacci__search_8cpp.html',1,'']]],
['fibonacci_5fsum_34',['fibonacci_sum',['../d3/dc9/namespacefibonacci__sum.html',1,'']]],
['fibonacci_5fsum_2ecpp_35',['fibonacci_sum.cpp',['../de/dc3/fibonacci__sum_8cpp.html',1,'']]],
['fibosum_36',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
['file_20name_20guidelines_37',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]],
['fill_38',['fill',['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'decimal_to_roman_numeral.cpp']]],
['find_39',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
['find_40',['find',['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
['find_5fmax_41',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
['find_5fmin_42',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
['find_5fnon_5frepeating_5finteger_43',['find_non_repeating_integer',['../d2/da7/namespacefind__non__repeating__integer.html',1,'find_non_repeating_integer'],['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer::find_non_repeating_integer()']]],
['find_5fnon_5frepeating_5fnumber_2ecpp_44',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]],
['find_5fpat_5fin_5ftext_45',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
['find_5fset_46',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
['find_5fzero_47',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_48',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_49',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_50',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
['findminimumedge_51',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
['findminindex_52',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
['findminnode_53',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['findnextgap_54',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
['findparent_55',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
['findset_56',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
['findshifttable_57',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
['first_58',['first',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1',1,'data_structures::linked_list::list']]],
['first_5ftest_59',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
['fit_60',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit()'],['../d8/df2/classadaline.html#a74e3c6c037b67895014414c5d75465e5',1,'adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d8/df2/classadaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)']]],
['fit_5ffrom_5fcsv_61',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
['fit_5fols_5fregressor_62',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
['floyd_5fcycle_5fdetection_5falgo_2ecpp_63',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]],
['for_20reviewers_20and_20maintainers_64',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
['formatter_65',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]],
['forward_66',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node']]],
['forward_5feuler_67',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
['forward_5feuler_5fstep_68',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
['freenode_69',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
['freq_5fmap_70',['freq_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2',1,'others::Cache::LFUCache']]],
['from_20the_20root_20node_71',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
['front_72',['front',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]],
['full_73',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]]
];

31
search/files_6.js
View File

@@ -1,19 +1,20 @@
var searchData=
[
['factorial_2ecpp_0',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]],
['false_5fposition_2ecpp_1',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]],
['fast_5ffourier_5ftransform_2ecpp_2',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]],
['fast_5finteger_5finput_2ecpp_3',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]],
['fast_5fpower_2ecpp_4',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]],
['fcfs_5fscheduling_2ecpp_5',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]],
['fenwick_5ftree_2ecpp_6',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]],
['fibonacci_2ecpp_7',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]],
['fibonacci_5ffast_2ecpp_8',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]],
['fibonacci_5flarge_2ecpp_9',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]],
['fibonacci_5fmatrix_5fexponentiation_2ecpp_10',['fibonacci_matrix_exponentiation.cpp',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html',1,'']]],
['fibonacci_5fsearch_2ecpp_11',['fibonacci_search.cpp',['../de/d0d/fibonacci__search_8cpp.html',1,'']]],
['fibonacci_5fsum_2ecpp_12',['fibonacci_sum.cpp',['../de/dc3/fibonacci__sum_8cpp.html',1,'']]],
['find_5fnon_5frepeating_5fnumber_2ecpp_13',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_14',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]],
['floyd_5fcycle_5fdetection_5falgo_2ecpp_15',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]]
['factorial_5fmemoization_2ecpp_1',['factorial_memoization.cpp',['../d2/d96/factorial__memoization_8cpp.html',1,'']]],
['false_5fposition_2ecpp_2',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]],
['fast_5ffourier_5ftransform_2ecpp_3',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]],
['fast_5finteger_5finput_2ecpp_4',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]],
['fast_5fpower_2ecpp_5',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]],
['fcfs_5fscheduling_2ecpp_6',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]],
['fenwick_5ftree_2ecpp_7',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]],
['fibonacci_2ecpp_8',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]],
['fibonacci_5ffast_2ecpp_9',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]],
['fibonacci_5flarge_2ecpp_10',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]],
['fibonacci_5fmatrix_5fexponentiation_2ecpp_11',['fibonacci_matrix_exponentiation.cpp',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html',1,'']]],
['fibonacci_5fsearch_2ecpp_12',['fibonacci_search.cpp',['../de/d0d/fibonacci__search_8cpp.html',1,'']]],
['fibonacci_5fsum_2ecpp_13',['fibonacci_sum.cpp',['../de/dc3/fibonacci__sum_8cpp.html',1,'']]],
['find_5fnon_5frepeating_5fnumber_2ecpp_14',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_15',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]],
['floyd_5fcycle_5fdetection_5falgo_2ecpp_16',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]]
];

101
search/functions_14.js
View File

File diff suppressed because one or more lines are too long

81
search/functions_6.js
View File

@@ -2,44 +2,45 @@ var searchData=
[
['f_0',['f',['../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397',1,'numerical_methods::simpson_method::f()'],['../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226',1,'numerical_methods::midpoint_rule::f()']]],
['fact_1',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]],
['factorial_2',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
['fast_5finvsqrt_3',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
['fast_5fpower_5flinear_4',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
['fast_5fpower_5frecursive_5',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
['fastfouriertransform_6',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
['fastinput_7',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
['fenwick_5ftree_8',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
['fib_9',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
['fib_5faccurate_10',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
['fibo_11',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
['fibonacci_12',['fibonacci',['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci']]],
['fibonacci_5fsearch_13',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
['fibosum_14',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
['fill_15',['fill',['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'decimal_to_roman_numeral.cpp']]],
['find_16',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
['find_17',['find',['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
['find_5fmax_18',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
['find_5fmin_19',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
['find_5fnon_5frepeating_5finteger_20',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer']]],
['find_5fpat_5fin_5ftext_21',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
['find_5fset_22',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
['find_5fzero_23',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_24',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_25',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
['findminimumedge_26',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
['findminindex_27',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
['findminnode_28',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['findnextgap_29',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
['findparent_30',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
['findset_31',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
['findshifttable_32',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
['first_5ftest_33',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
['fit_34',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit()'],['../d8/df2/classadaline.html#a74e3c6c037b67895014414c5d75465e5',1,'adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d8/df2/classadaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)']]],
['fit_5ffrom_5fcsv_35',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
['fit_5fols_5fregressor_36',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
['forward_5feuler_37',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
['forward_5feuler_5fstep_38',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
['freenode_39',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
['front_40',['front',['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue']]],
['full_41',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]]
['fact_5frecursion_2',['fact_recursion',['../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b',1,'math']]],
['factorial_3',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
['fast_5finvsqrt_4',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
['fast_5fpower_5flinear_5',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
['fast_5fpower_5frecursive_6',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
['fastfouriertransform_7',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
['fastinput_8',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
['fenwick_5ftree_9',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
['fib_10',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
['fib_5faccurate_11',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
['fibo_12',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
['fibonacci_13',['fibonacci',['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci']]],
['fibonacci_5fsearch_14',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
['fibosum_15',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
['fill_16',['fill',['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'decimal_to_roman_numeral.cpp']]],
['find_17',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
['find_18',['find',['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
['find_5fmax_19',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
['find_5fmin_20',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
['find_5fnon_5frepeating_5finteger_21',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer']]],
['find_5fpat_5fin_5ftext_22',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
['find_5fset_23',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
['find_5fzero_24',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_25',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_26',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
['findminimumedge_27',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
['findminindex_28',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
['findminnode_29',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['findnextgap_30',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
['findparent_31',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
['findset_32',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
['findshifttable_33',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
['first_5ftest_34',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
['fit_35',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit()'],['../d8/df2/classadaline.html#a74e3c6c037b67895014414c5d75465e5',1,'adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d8/df2/classadaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)']]],
['fit_5ffrom_5fcsv_36',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
['fit_5fols_5fregressor_37',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
['forward_5feuler_38',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
['forward_5feuler_5fstep_39',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
['freenode_40',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
['front_41',['front',['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue']]],
['full_42',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]]
];

2
search/functions_d.js
View File

File diff suppressed because one or more lines are too long

11
search/variables_c.js
View File

@@ -11,9 +11,10 @@ var searchData=
['max_5fsize_8',['max_size',['../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8',1,'queue_using_array.cpp']]],
['maxelement_9',['maxElement',['../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53',1,'dsu']]],
['maxnode_10',['maxNode',['../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]],
['min_5fdistance_11',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]],
['minelement_12',['minElement',['../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63',1,'dsu']]],
['minfreq_13',['minFreq',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285',1,'others::Cache::LFUCache']]],
['month_14',['month',['../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde',1,'EasterYearMonthDay']]],
['moves_15',['moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71',1,'machine_learning::aystar_search::EightPuzzle']]]
['memo_11',['memo',['../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217',1,'factorial_memoization.cpp']]],
['min_5fdistance_12',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]],
['minelement_13',['minElement',['../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63',1,'dsu']]],
['minfreq_14',['minFreq',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285',1,'others::Cache::LFUCache']]],
['month_15',['month',['../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde',1,'EasterYearMonthDay']]],
['moves_16',['moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71',1,'machine_learning::aystar_search::EightPuzzle']]]
];