backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 19:41:16 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 27f1ed312f

Browse Source
This commit is contained in:
github-actions
2021-10-16 01:44:46 +00:00
parent df95b45011
commit 8dfb738786
69 changed files with 3076 additions and 1915 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
dd/d47/namespacemath.html
View File

@@ -129,12 +129,12 @@ Functions</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >for IO operations </p>
<p >Math algorithms.</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
<p >for io operations</p>
<p >Evaluate recurrence relation using <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">matrix exponentiation</a>.</p>
<p >for assert</p>
<p >Math algorithms.</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p >for assert for int32_t type for atoi</p>
<p >Mathematical algorithms</p>
@@ -142,6 +142,7 @@ Functions</h2></td></tr>
<p >Mathematical algorithms</p>
<p >for assert for mathematical functions for passing in functions</p>
<p >Mathematical functions</p>
<p >for math functions for fixed size data types for time to initialize rng for function pointers for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for random number generation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
<p >Mathematical algorithms</p>
<p >Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is <code>f(n) = f(n-1) + f(n-2)</code> where <code>f(0) = 0</code> and <code>f(1) = 1</code>. Note that the method used only demonstrates recurrence relation with one variable (n), unlike <code>nCr</code> problem, since it has two (n, r)</p>

4
dd/d47/namespacemath.js
View File

@@ -13,6 +13,10 @@ var namespacemath =
[ "mod_division", "df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7", null ],
[ "power", "df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179", null ]
] ],
[ "monte_carlo", null, [
[ "generate_samples", "db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf", null ],
[ "integral_monte_carlo", "db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51", null ]
] ],
[ "n_bonacci", null, [
[ "N_bonacci", "db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d", null ]
] ],