mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-17 12:02:22 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -4,7 +4,7 @@
|
||||
<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="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: math/gcd_of_n_numbers.cpp File Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -248,9 +248,9 @@ template<std::size_t n> </div>
|
||||
<div class="line"><span class="lineno"> 68</span> }</div>
|
||||
<div class="line"><span class="lineno"> 69</span> </div>
|
||||
<div class="line"><span class="lineno"> 70</span> <span class="comment">// divisors can be negative, we only want the positive value</span></div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = std::abs(a[0]);</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">int</span> result = std::abs(a[0]);</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">for</span> (std::size_t i = 1; i < n; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(result, std::abs(a[i]));</div>
|
||||
<div class="line"><span class="lineno"> 73</span> result = gcd_two(result, std::abs(a[i]));</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">if</span> (result == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">break</span>; <span class="comment">// Further computations still result in gcd of 1</span></div>
|
||||
<div class="line"><span class="lineno"> 76</span> }</div>
|
||||
@@ -258,7 +258,6 @@ template<std::size_t n> </div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 79</span>}</div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a509a35e11ed1e17a9e00dd56320a4181"><div class="ttname"><a href="#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a></div><div class="ttdeci">int gcd_two(int x, int y)</div><div class="ttdoc">Function to compute GCD of 2 numbers x and y.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00035">gcd_of_n_numbers.cpp:35</a></div></div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a71b9357c7a722f8208499d9ba573297a"><div class="ttname"><a href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a></div><div class="ttdeci">bool check_all_zeros(const std::array< int, n > &a)</div><div class="ttdoc">Function to check if all elements in the array are 0.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00053">gcd_of_n_numbers.cpp:53</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -301,7 +300,7 @@ template<std::size_t n> </div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span> (x == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">return</span> y;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(y, x % y); <span class="comment">// Euclidean method</span></div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span> gcd_two(y, x % y); <span class="comment">// Euclidean method</span></div>
|
||||
<div class="line"><span class="lineno"> 44</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -351,7 +350,7 @@ template<std::size_t n> </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -370,15 +369,16 @@ template<std::size_t n> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> std::array<int, 7> array_7 = {10350, -24150, 0, 17250, 37950, -127650, 51750};</div>
|
||||
<div class="line"><span class="lineno"> 95</span> std::array<int, 7> array_8 = {9500000, -12121200, 0, 4444, 0, 0, 123456789};</div>
|
||||
<div class="line"><span class="lineno"> 96</span> </div>
|
||||
<div class="line"><span class="lineno"> 97</span> assert(math::gcd_of_n_numbers::gcd(array_1) == -1);</div>
|
||||
<div class="line"><span class="lineno"> 98</span> assert(math::gcd_of_n_numbers::gcd(array_2) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 99</span> assert(math::gcd_of_n_numbers::gcd(array_3) == 2);</div>
|
||||
<div class="line"><span class="lineno"> 100</span> assert(math::gcd_of_n_numbers::gcd(array_4) == 6);</div>
|
||||
<div class="line"><span class="lineno"> 101</span> assert(math::gcd_of_n_numbers::gcd(array_5) == 100);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> assert(math::gcd_of_n_numbers::gcd(array_6) == -1);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> assert(math::gcd_of_n_numbers::gcd(array_7) == 3450);</div>
|
||||
<div class="line"><span class="lineno"> 104</span> assert(math::gcd_of_n_numbers::gcd(array_8) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 97</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_1) == -1);</div>
|
||||
<div class="line"><span class="lineno"> 98</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_2) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 99</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_3) == 2);</div>
|
||||
<div class="line"><span class="lineno"> 100</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_4) == 6);</div>
|
||||
<div class="line"><span class="lineno"> 101</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_5) == 100);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_6) == -1);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_7) == 3450);</div>
|
||||
<div class="line"><span class="lineno"> 104</span> assert(<a class="code hl_function" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_8) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 105</span>}</div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a1161713c662a14c2d5e33504f4324532"><div class="ttname"><a href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a></div><div class="ttdeci">int gcd(const std::array< int, n > &a)</div><div class="ttdoc">Main program to compute GCD using the Euclidean algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00064">gcd_of_n_numbers.cpp:64</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -388,7 +388,7 @@ template<std::size_t n> </div>
|
||||
<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="../../d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.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.12.0 </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>
|
||||
|
||||
@@ -1,8 +1,8 @@
|
||||
var gcd__of__n__numbers_8cpp =
|
||||
[
|
||||
[ "check_all_zeros", "d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a", null ],
|
||||
[ "gcd", "d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532", null ],
|
||||
[ "gcd_two", "d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181", null ],
|
||||
[ "math::gcd_of_n_numbers::check_all_zeros", "d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a", null ],
|
||||
[ "math::gcd_of_n_numbers::gcd", "d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532", null ],
|
||||
[ "math::gcd_of_n_numbers::gcd_two", "d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181", null ],
|
||||
[ "main", "d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "test", "d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
|
||||
];
|
||||
@@ -4,7 +4,7 @@
|
||||
<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="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: math/gcd_of_n_numbers.cpp Source File</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -124,12 +124,12 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../')
|
||||
<div class="headertitle"><div class="title">gcd_of_n_numbers.cpp</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../d1/d11/gcd__of__n__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
||||
<a href="../../d1/d11/gcd__of__n__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
||||
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include <algorithm></span> </div>
|
||||
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <array></span> </div>
|
||||
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <cassert></span> </div>
|
||||
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <iostream></span> </div>
|
||||
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
||||
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span></div>
|
||||
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
|
||||
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/ddb/namespacegcd__of__n__numbers.html">gcd_of_n_numbers</a> {</div>
|
||||
<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
|
||||
@@ -144,7 +144,7 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../')
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(y, x % y); <span class="comment">// Euclidean method</span></div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> </div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span></div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="keyword">template</span> <std::<span class="keywordtype">size_t</span> n></div>
|
||||
<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a"> 53</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">check_all_zeros</a>(<span class="keyword">const</span> std::array<int, n> &a) {</div>
|
||||
@@ -152,10 +152,10 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../')
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">return</span> std::all_of(a.begin(), a.end(), [](<span class="keywordtype">int</span> x) { return x == 0; });</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span></div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="keyword">template</span> <std::<span class="keywordtype">size_t</span> n></div>
|
||||
<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532"> 64</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(<span class="keyword">const</span> std::array<int, n> &a) {</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532"> 64</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">gcd</a>(<span class="keyword">const</span> std::array<int, n> &a) {</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// GCD is undefined if all elements in the array are 0</span></div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">check_all_zeros</a>(a)) {</div>
|
||||
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">return</span> -1; <span class="comment">// Use std::optional to represent undefined GCD</span></div>
|
||||
@@ -174,7 +174,7 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../')
|
||||
</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>} <span class="comment">// namespace gcd_of_n_numbers</span></div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>} <span class="comment">// namespace math</span></div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span></div>
|
||||
<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 87</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> std::array<int, 1> array_1 = {0};</div>
|
||||
@@ -186,24 +186,24 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../')
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::array<int, 7> array_7 = {10350, -24150, 0, 17250, 37950, -127650, 51750};</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> std::array<int, 7> array_8 = {9500000, -12121200, 0, 4444, 0, 0, 123456789};</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> assert(math::gcd_of_n_numbers::gcd(array_1) == -1);</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> assert(math::gcd_of_n_numbers::gcd(array_2) == 1);</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> assert(math::gcd_of_n_numbers::gcd(array_3) == 2);</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> assert(math::gcd_of_n_numbers::gcd(array_4) == 6);</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> assert(math::gcd_of_n_numbers::gcd(array_5) == 100);</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> assert(math::gcd_of_n_numbers::gcd(array_6) == -1);</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> assert(math::gcd_of_n_numbers::gcd(array_7) == 3450);</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> assert(math::gcd_of_n_numbers::gcd(array_8) == 1);</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_1) == -1);</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_2) == 1);</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_3) == 2);</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_4) == 6);</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_5) == 100);</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_6) == -1);</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_7) == 3450);</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> assert(<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a>(array_8) == 1);</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span></div>
|
||||
<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 111</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementation</span></div>
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span>}</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 class="ttc" id="agcd__of__n__numbers_8cpp_html_a1161713c662a14c2d5e33504f4324532"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a></div><div class="ttdeci">int gcd(const std::array< int, n > &a)</div><div class="ttdoc">Main program to compute GCD using the Euclidean algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">gcd_of_n_numbers.cpp:64</a></div></div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a509a35e11ed1e17a9e00dd56320a4181"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a></div><div class="ttdeci">int gcd_two(int x, int y)</div><div class="ttdoc">Function to compute GCD of 2 numbers x and y.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">gcd_of_n_numbers.cpp:35</a></div></div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a71b9357c7a722f8208499d9ba573297a"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a></div><div class="ttdeci">bool check_all_zeros(const std::array< int, n > &a)</div><div class="ttdoc">Function to check if all elements in the array are 0.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">gcd_of_n_numbers.cpp:53</a></div></div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00087">gcd_of_n_numbers.cpp:87</a></div></div>
|
||||
@@ -216,7 +216,7 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../')
|
||||
<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="../../d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.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.12.0 </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>
|
||||
|
||||
Reference in New Issue
Block a user