mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
8 lines
629 B
Plaintext
8 lines
629 B
Plaintext
<map id="math/gcd_iterative_euclidean.cpp" name="math/gcd_iterative_euclidean.cpp">
|
|
<area shape="rect" id="Node000001" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm" alt="" coords="26,5,154,46"/>
|
|
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,77,120"/>
|
|
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,48,59,82,54,79,76,45"/>
|
|
<area shape="rect" id="Node000003" title=" " alt="" coords="100,94,179,120"/>
|
|
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="105,45,126,79,122,82,100,48"/>
|
|
</map>
|