mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 06:12:11 +08:00
300 lines
36 KiB
HTML
300 lines
36 KiB
HTML
<!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.12.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: math Directory Reference</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<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="resize.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/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
});
|
|
</script>
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectalign">
|
|
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.12.0 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() { codefold.init(0); });
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function(){initNavTree('dir_296d53ceaeaa7e099814a6def439fe8a.html',''); initResizable(true); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">math Directory Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
|
|
Files</h2></td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/d99/aliquot__sum_8cpp.html">aliquot_sum.cpp</a></td></tr>
|
|
<tr class="memdesc:de/d99/aliquot__sum_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Program to return the <a href="https://en.wikipedia.org/wiki/Aliquot_sum" target="_blank">Aliquot Sum</a> of a number. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/d51/approximate__pi_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d82/area_8cpp.html">area.cpp</a></td></tr>
|
|
<tr class="memdesc:dc/d82/area_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcf/binary__exponent_8cpp.html">binary_exponent.cpp</a></td></tr>
|
|
<tr class="memdesc:de/dcf/binary__exponent_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">C++ Program to find Binary Exponent Iteratively and Recursively. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/db1/binomial__calculate_8cpp.html">binomial_calculate.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/db1/binomial__calculate_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></td></tr>
|
|
<tr class="memdesc:d5/df6/check__amicable__pair_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dd5/check__factorial_8cpp.html">check_factorial.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/dd5/check__factorial_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/d93/check__prime_8cpp.html">check_prime.cpp</a></td></tr>
|
|
<tr class="memdesc:db/d93/check__prime_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d67/complex__numbers_8cpp.html">complex_numbers.cpp</a></td></tr>
|
|
<tr class="memdesc:d5/d67/complex__numbers_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d89/double__factorial_8cpp.html">double_factorial.cpp</a></td></tr>
|
|
<tr class="memdesc:d7/d89/double__factorial_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\). <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d7/da6/eratosthenes_8cpp.html">eratosthenes.cpp</a></td></tr>
|
|
<tr class="memdesc:d7/da6/eratosthenes_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">The Sieve of Eratosthenes</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d23/eulers__totient__function_8cpp.html">eulers_totient_function.cpp</a></td></tr>
|
|
<tr class="memdesc:da/d23/eulers__totient__function_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html">extended_euclid_algorithm.cpp</a></td></tr>
|
|
<tr class="memdesc:d9/d5d/extended__euclid__algorithm_8cpp"><td class="mdescLeft"> </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="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </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"> </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="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </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"> </td><td class="mdescRight">Faster computation for \(a^b\). <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d89/fibonacci_8cpp.html">fibonacci.cpp</a></td></tr>
|
|
<tr class="memdesc:d9/d89/fibonacci_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Generate fibonacci sequence. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/fibonacci__fast_8cpp.html">fibonacci_fast.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/d32/fibonacci__fast_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Faster computation of Fibonacci series. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/de4/fibonacci__large_8cpp.html">fibonacci_large.cpp</a></td></tr>
|
|
<tr class="memdesc:de/de4/fibonacci__large_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html">fibonacci_matrix_exponentiation.cpp</a></td></tr>
|
|
<tr class="memdesc:da/dc9/fibonacci__matrix__exponentiation_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">This program computes the N^th Fibonacci number in modulo mod input argument . <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc3/fibonacci__sum_8cpp.html">fibonacci_sum.cpp</a></td></tr>
|
|
<tr class="memdesc:de/dc3/fibonacci__sum_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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)\). <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html">finding_number_of_digits_in_a_number.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/d46/finding__number__of__digits__in__a__number_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">[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>) <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html">gcd_iterative_euclidean.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/da0/gcd__iterative__euclidean_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.cpp</a></td></tr>
|
|
<tr class="memdesc:d1/d11/gcd__of__n__numbers_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">This program aims at calculating the GCD of n numbers by division method. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html">gcd_recursive_euclidean.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/d45/gcd__recursive__euclidean_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d1/de9/integral__approximation_8cpp.html">integral_approximation.cpp</a></td></tr>
|
|
<tr class="memdesc:d1/de9/integral__approximation_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/d40/integral__approximation2_8cpp.html">integral_approximation2.cpp</a></td></tr>
|
|
<tr class="memdesc:db/d40/integral__approximation2_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/db8/inv__sqrt_8cpp.html">inv_sqrt.cpp</a></td></tr>
|
|
<tr class="memdesc:d6/db8/inv__sqrt_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a>. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/d9f/iterative__factorial_8cpp.html">iterative_factorial.cpp</a></td></tr>
|
|
<tr class="memdesc:db/d9f/iterative__factorial_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d9d/large__factorial_8cpp.html">large_factorial.cpp</a></td></tr>
|
|
<tr class="memdesc:d6/d9d/large__factorial_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute factorial of any arbitratily large number/. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d86/large__number_8h.html">large_number.h</a></td></tr>
|
|
<tr class="memdesc:d4/d86/large__number_8h"><td class="mdescLeft"> </td><td class="mdescRight">Library to perform arithmatic operations on arbitrarily large numbers. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d7a/largest__power_8cpp.html">largest_power.cpp</a></td></tr>
|
|
<tr class="memdesc:d5/d7a/largest__power_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d83/lcm__sum_8cpp.html">lcm_sum.cpp</a></td></tr>
|
|
<tr class="memdesc:d5/d83/lcm__sum_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) +
|
|
\mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\). <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d21/least__common__multiple_8cpp.html">least_common_multiple.cpp</a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d44/magic__number_8cpp.html">magic_number.cpp</a></td></tr>
|
|
<tr class="memdesc:d9/d44/magic__number_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d42/miller__rabin_8cpp.html">miller_rabin.cpp</a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/d72/modular__division_8cpp.html">modular_division.cpp</a></td></tr>
|
|
<tr class="memdesc:df/d72/modular__division_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html">modular_exponentiation.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/d6d/modular__exponentiation_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">C++ Program for Modular Exponentiation Iteratively. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/d53/modular__inverse__fermat__little__theorem_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html">modular_inverse_simple.cpp</a></td></tr>
|
|
<tr class="memdesc:d6/d2d/modular__inverse__simple_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/d27/n__bonacci_8cpp.html">n_bonacci.cpp</a></td></tr>
|
|
<tr class="memdesc:db/d27/n__bonacci_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dbb/n__choose__r_8cpp.html">n_choose_r.cpp</a></td></tr>
|
|
<tr class="memdesc:d1/dbb/n__choose__r_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dab/ncr__modulo__p_8cpp.html">ncr_modulo_p.cpp</a></td></tr>
|
|
<tr class="memdesc:de/dab/ncr__modulo__p_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a>. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/da2/number__of__positive__divisors_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">C++ Program to calculate the number of positive divisors. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dfe/perimeter_8cpp.html">perimeter.cpp</a></td></tr>
|
|
<tr class="memdesc:d3/dfe/perimeter_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/def/power__for__huge__numbers_8cpp.html">power_for_huge_numbers.cpp</a></td></tr>
|
|
<tr class="memdesc:df/def/power__for__huge__numbers_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute powers of large numbers. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d38/power__of__two_8cpp.html">power_of_two.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/d38/power__of__two_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation to check whether a number is a power of 2 or not. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="db/d0d/prime__factorization_8cpp.html">prime_factorization.cpp</a></td></tr>
|
|
<tr class="memdesc:db/d0d/prime__factorization_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Prime factorization of positive integers. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/d9b/prime__numbers_8cpp.html">prime_numbers.cpp</a></td></tr>
|
|
<tr class="memdesc:de/d9b/prime__numbers_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Get list of prime numbers. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html">primes_up_to_billion.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/d9c/primes__up__to__billion_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute prime numbers upto 1 billion. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html">quadratic_equations_complex_numbers.cpp</a></td></tr>
|
|
<tr class="memdesc:da/d18/quadratic__equations__complex__numbers_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac < 0. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></td></tr>
|
|
<tr class="memdesc:d0/d08/realtime__stats_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Compute statistics for data entered in rreal-time. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></td></tr>
|
|
<tr class="memdesc:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Get list of prime numbers using Sieve of Eratosthenes. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d24/sqrt__double_8cpp.html">sqrt_double.cpp</a></td></tr>
|
|
<tr class="memdesc:da/d24/sqrt__double_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">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. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="de/d47/string__fibonacci_8cpp.html">string_fibonacci.cpp</a></td></tr>
|
|
<tr class="memdesc:de/d47/string__fibonacci_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">This Programme returns the Nth fibonacci as a string. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html">sum_of_binomial_coefficient.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/d9d/sum__of__binomial__coefficient_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Algorithm to find sum of binomial coefficients of a given positive integer. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d83/sum__of__digits_8cpp.html">sum_of_digits.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/d83/sum__of__digits_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">A C++ Program to find the Sum of Digits of input integer. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="df/d66/vector__cross__product_8cpp.html">vector_cross_product.cpp</a></td></tr>
|
|
<tr class="memdesc:df/d66/vector__cross__product_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="da/d39/volume_8cpp.html">volume.cpp</a></td></tr>
|
|
<tr class="memdesc:da/d39/volume_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html">math</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.12.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|