backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-11-05 23:28:34 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for fddedd8864

Browse Source
This commit is contained in:
realstealthninja
2024-10-07 13:28:13 +00:00
parent 81ec715c16
commit e37aaa437e
62 changed files with 2565 additions and 1801 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d4/d45/gcd__recursive__euclidean_8cpp.html
View File

@@ -128,7 +128,7 @@ Functions</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>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> </p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm">gcd_iterative_euclidean.cpp</a>, <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html" title="This program aims at calculating the GCD of n numbers by division method.">gcd_of_n_numbers.cpp</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm">gcd_iterative_euclidean.cpp</a>, <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html" title="This program aims at calculating the GCD of n numbers.">gcd_of_n_numbers.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae48807fa2b7000afae599e67f327545e" name="ae48807fa2b7000afae599e67f327545e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae48807fa2b7000afae599e67f327545e">&#9670;&#160;</a></span>gcd()</h2>

2
d4/da0/gcd__iterative__euclidean_8cpp.html
View File

@@ -129,7 +129,7 @@ Functions</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>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> </p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm">gcd_recursive_euclidean.cpp</a>, <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html" title="This program aims at calculating the GCD of n numbers by division method.">gcd_of_n_numbers.cpp</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm">gcd_recursive_euclidean.cpp</a>, <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html" title="This program aims at calculating the GCD of n numbers.">gcd_of_n_numbers.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae48807fa2b7000afae599e67f327545e" name="ae48807fa2b7000afae599e67f327545e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae48807fa2b7000afae599e67f327545e">&#9670;&#160;</a></span>gcd()</h2>