backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for d4962c3032

Browse Source
This commit is contained in:
realstealthninja
2025-08-14 04:29:32 +00:00
parent 67d95bf85f
commit e364889a34
986 changed files with 1471 additions and 1483 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
db/dfb/maximum__circular__subarray_8cpp.html
View File

@@ -179,11 +179,11 @@ Functions</h2></td></tr>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 90</span>}</div>
<p class="definition">Definition at line <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 86</span> {</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 89</span>}</div>
<div class="ttc" id="amaximum__circular__subarray_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#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="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00064">maximum_circular_subarray.cpp:64</a></div></div>
</div><!-- fragment -->
</div>
@@ -221,15 +221,14 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 67</span> <span class="comment">// Output: 22 </span></div>
<div class="line"><span class="lineno"> 68</span> <span class="comment">// Explanation: Subarray 12, 8, -8, 9, -9, 10 gives the maximum sum, that is 22.</span></div>
<div class="line"><span class="lineno"> 69</span> </div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordtype">int</span> n = 7; <span class="comment">// size of the array</span></div>
<div class="line"><span class="lineno"> 71</span> std::vector&lt;int&gt; arr = {8, -8, 9, -9, 10, -11, 12}; </div>
<div class="line"><span class="lineno"> 72</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 22); <span class="comment">// this ensures that the algorithm works as expected</span></div>
<div class="line"><span class="lineno"> 73</span> </div>
<div class="line"><span class="lineno"> 74</span> arr = {8, -8, 10, -9, 10, -11, 12};</div>
<div class="line"><span class="lineno"> 75</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 23);</div>
<div class="line"><span class="lineno"> 76</span> </div>
<div class="line"><span class="lineno"> 77</span> std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 78</span>}</div>
<div class="line"><span class="lineno"> 70</span> std::vector&lt;int&gt; arr = {8, -8, 9, -9, 10, -11, 12}; </div>
<div class="line"><span class="lineno"> 71</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 22); <span class="comment">// this ensures that the algorithm works as expected</span></div>
<div class="line"><span class="lineno"> 72</span> </div>
<div class="line"><span class="lineno"> 73</span> arr = {8, -8, 10, -9, 10, -11, 12};</div>
<div class="line"><span class="lineno"> 74</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 23);</div>
<div class="line"><span class="lineno"> 75</span> </div>
<div class="line"><span class="lineno"> 76</span> std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 77</span>}</div>
<div class="ttc" id="anamespacedynamic__programming_html_a5239174fa0d987f2c67edc1f2af82beb"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a></div><div class="ttdeci">int maxCircularSum(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">returns the maximum contiguous circular sum of an array</div><div class="ttdef"><b>Definition</b> <a href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00026">maximum_circular_subarray.cpp:26</a></div></div>
</div><!-- fragment -->
</div>