backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity
Files
14583a2f33720eba2e2786d75e8e2312b85fa667
C-Plus-Plus/d9/d5d/extended__euclid__algorithm_8cpp.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

402 lines
24 KiB
HTML
Raw Blame History

<!-- 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: math/extended_euclid_algorithm.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="../../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/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.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @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&amp;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&amp;dn=expat.txt MIT */
$(function(){initNavTree('d9/d5d/extended__euclid__algorithm_8cpp.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="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">extended_euclid_algorithm.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>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>)
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for extended_euclid_algorithm.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dc7/extended__euclid__algorithm_8cpp__incl.svg" width="266" height="126"><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="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:abe92d63a0ff9bda7e304df510d5dd217" id="r_abe92d63a0ff9bda7e304df510d5dd217"><td class="memTemplParams" colspan="2">template&lt;typename T, typename T2&gt; </td></tr>
<tr class="memitem:abe92d63a0ff9bda7e304df510d5dd217"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a> (T *r, T *r0, const T2 quotient)</td></tr>
<tr class="separator:abe92d63a0ff9bda7e304df510d5dd217"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1792ac7c33aaf26b860ab55f5652ab25" id="r_a1792ac7c33aaf26b860ab55f5652ab25"><td class="memTemplParams" colspan="2">template&lt;typename T1, typename T2&gt; </td></tr>
<tr class="memitem:a1792ac7c33aaf26b860ab55f5652ab25"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a> (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</td></tr>
<tr class="separator:a1792ac7c33aaf26b860ab55f5652ab25"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acba15ca55b3e7dcb91f3c65d72ba052d" id="r_acba15ca55b3e7dcb91f3c65d72ba052d"><td class="memTemplParams" colspan="2">template&lt;typename T, typename T2&gt; </td></tr>
<tr class="memitem:acba15ca55b3e7dcb91f3c65d72ba052d"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a> (T A, T B, T *GCD, T2 *x, T2 *y)</td></tr>
<tr class="separator:acba15ca55b3e7dcb91f3c65d72ba052d"><td class="memSeparator" colspan="2">&#160;</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. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>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>) </p>
<p>Finding coefficients of a and b ie x and y in Bézout's identity </p><p class="formulaDsp">
\[\text{gcd}(a, b) = a \times x + b \times y \]
</p>
<p> This is also used in finding Modular multiplicative inverse of a number. (A * B)M == 1 Here B is the MMI of A for given M, so extendedEuclid (A, M) gives B. </p>
<p class="definition">Definition in file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="acba15ca55b3e7dcb91f3c65d72ba052d" name="acba15ca55b3e7dcb91f3c65d72ba052d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acba15ca55b3e7dcb91f3c65d72ba052d">&#9670;&#160;</a></span>extendedEuclid()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T, typename T2&gt; </div>
<table class="memname">
<tr>
<td class="memname">void extendedEuclid </td>
<td>(</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>B</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>GCD</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T2 *</td> <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T2 *</td> <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Implementation using recursive algorithm</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">A</td><td>unsigned </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">B</td><td>unsigned </td></tr>
<tr><td class="paramdir">[out]</td><td class="paramname">GCD</td><td>unsigned </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>signed </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">y</td><td>signed </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (B &gt; A)</div>
<div class="line"><span class="lineno"> 73</span> std::swap(A, B); <span class="comment">// Ensure that A &gt;= B</span></div>
<div class="line"><span class="lineno"> 74</span> </div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">if</span> (B == 0) {</div>
<div class="line"><span class="lineno"> 76</span> *GCD = A;</div>
<div class="line"><span class="lineno"> 77</span> *x = 1;</div>
<div class="line"><span class="lineno"> 78</span> *y = 0;</div>
<div class="line"><span class="lineno"> 79</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 80</span> <a class="code hl_function" href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a>(B, A % B, GCD, x, y);</div>
<div class="line"><span class="lineno"> 81</span> T2 temp = *x;</div>
<div class="line"><span class="lineno"> 82</span> *x = *y;</div>
<div class="line"><span class="lineno"> 83</span> *y = temp - (A / B) * (*y);</div>
<div class="line"><span class="lineno"> 84</span> }</div>
<div class="line"><span class="lineno"> 85</span>}</div>
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00071">extended_euclid_algorithm.cpp:71</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a1792ac7c33aaf26b860ab55f5652ab25" name="a1792ac7c33aaf26b860ab55f5652ab25"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1792ac7c33aaf26b860ab55f5652ab25">&#9670;&#160;</a></span>extendedEuclid_1()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T1, typename T2&gt; </div>
<table class="memname">
<tr>
<td class="memname">void extendedEuclid_1 </td>
<td>(</td>
<td class="paramtype">T1</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T1</td> <td class="paramname"><span class="paramname"><em>B</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T1 *</td> <td class="paramname"><span class="paramname"><em>GCD</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T2 *</td> <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T2 *</td> <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Implementation using iterative algorithm from <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Pseudocode" target="_blank">Wikipedia</a></p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">A</td><td>unsigned </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">B</td><td>unsigned </td></tr>
<tr><td class="paramdir">[out]</td><td class="paramname">GCD</td><td>unsigned </td></tr>
<tr><td class="paramdir">[out]</td><td class="paramname">x</td><td>signed </td></tr>
<tr><td class="paramdir">[out]</td><td class="paramname">y</td><td>signed </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">if</span> (B &gt; A)</div>
<div class="line"><span class="lineno"> 44</span> std::swap(A, B); <span class="comment">// Ensure that A &gt;= B</span></div>
<div class="line"><span class="lineno"> 45</span> </div>
<div class="line"><span class="lineno"> 46</span> T2 s = 0, s0 = 1;</div>
<div class="line"><span class="lineno"> 47</span> T2 t = 1, t0 = 0;</div>
<div class="line"><span class="lineno"> 48</span> T1 r = B, r0 = A;</div>
<div class="line"><span class="lineno"> 49</span> </div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">while</span> (r != 0) {</div>
<div class="line"><span class="lineno"> 51</span> T1 quotient = r0 / r;</div>
<div class="line"><span class="lineno"> 52</span> <a class="code hl_function" href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(&amp;r, &amp;r0, quotient);</div>
<div class="line"><span class="lineno"> 53</span> <a class="code hl_function" href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(&amp;s, &amp;s0, quotient);</div>
<div class="line"><span class="lineno"> 54</span> <a class="code hl_function" href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(&amp;t, &amp;t0, quotient);</div>
<div class="line"><span class="lineno"> 55</span> }</div>
<div class="line"><span class="lineno"> 56</span> *GCD = r0;</div>
<div class="line"><span class="lineno"> 57</span> *x = s0;</div>
<div class="line"><span class="lineno"> 58</span> *y = t0;</div>
<div class="line"><span class="lineno"> 59</span>}</div>
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_abe92d63a0ff9bda7e304df510d5dd217"><div class="ttname"><a href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a></div><div class="ttdeci">void update_step(T *r, T *r0, const T2 quotient)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00025">extended_euclid_algorithm.cpp:25</a></div></div>
</div><!-- fragment -->
</div>
</div>
<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. </p>
<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 88</span> {</div>
<div class="line"><span class="lineno"> 89</span> uint32_t a, b, <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>;</div>
<div class="line"><span class="lineno"> 90</span> int32_t x, y;</div>
<div class="line"><span class="lineno"> 91</span> std::cin &gt;&gt; a &gt;&gt; b;</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_function" href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a>(a, b, &amp;<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>, &amp;x, &amp;y);</div>
<div class="line"><span class="lineno"> 93</span> std::cout &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_function" href="#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a>(a, b, &amp;<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>, &amp;x, &amp;y);</div>
<div class="line"><span class="lineno"> 95</span> std::cout &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 97</span>}</div>
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00042">extended_euclid_algorithm.cpp:42</a></div></div>
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="abe92d63a0ff9bda7e304df510d5dd217" name="abe92d63a0ff9bda7e304df510d5dd217"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abe92d63a0ff9bda7e304df510d5dd217">&#9670;&#160;</a></span>update_step()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T, typename T2&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void update_step </td>
<td>(</td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>r</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>r0</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T2</td> <td class="paramname"><span class="paramname"><em>quotient</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>function to update the coefficients per iteration </p><p class="formulaDsp">
\[r_0,\,r = r,\, r_0 - \text{quotient}\times r\]
</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in,out]</td><td class="paramname">r</td><td>signed or unsigned </td></tr>
<tr><td class="paramdir">[in,out]</td><td class="paramname">r0</td><td>signed or unsigned </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">quotient</td><td>unsigned </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 25</span> {</div>
<div class="line"><span class="lineno"> 26</span> T temp = *r;</div>
<div class="line"><span class="lineno"> 27</span> *r = *r0 - (quotient * temp);</div>
<div class="line"><span class="lineno"> 28</span> *r0 = temp;</div>
<div class="line"><span class="lineno"> 29</span>}</div>
</div><!-- fragment -->
</div>
</div>
</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="navelem"><a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html">extended_euclid_algorithm.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.13.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink