backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-24 05:42:59 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
d4/da0/kadane_8cpp.html
View File

@@ -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++: dynamic_programming/kadane.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&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -190,7 +190,7 @@ Algorithm</h3>
<p class="definition">Definition at line <a class="el" href="../../d4/da0/kadane_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d4/da0/kadane_8cpp_source.html">kadane.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 60</span> {</div>
<div class="line"><span class="lineno"> 61</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 5;</div>
<div class="line"><span class="lineno"> 61</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = 5;</div>
<div class="line"><span class="lineno"> 62</span> std::array&lt;int, N&gt; n{}; <span class="comment">// declaring array</span></div>
<div class="line"><span class="lineno"> 63</span> <span class="comment">// taking values of elements from user</span></div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n.size(); i++) {</div>
@@ -198,13 +198,13 @@ Algorithm</h3>
<div class="line"><span class="lineno"> 66</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 67</span> std::cin &gt;&gt; n[i];</div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordtype">int</span> max_sum = dynamic_programming::kadane::maxSubArray&lt;N&gt;(</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordtype">int</span> max_sum = <a class="code hl_function" href="#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray&lt;N&gt;</a>(</div>
<div class="line"><span class="lineno"> 70</span> n); <span class="comment">// calling maxSubArray function</span></div>
<div class="line"><span class="lineno"> 71</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum subarray sum is &quot;</span> &lt;&lt; max_sum; <span class="comment">// Printing the answer</span></div>
<div class="line"><span class="lineno"> 72</span> </div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 74</span>}</div>
<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
<div class="ttc" id="akadane_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array&lt; int, N &gt; &amp;n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/kadane_8cpp_source.html#l00042">kadane.cpp:42</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -261,7 +261,7 @@ template&lt;size_t N&gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d4/da0/kadane_8cpp.html">kadane.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>