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

Documentation for f0b35b657a

Browse Source
This commit is contained in:
github-actions
2022-10-17 04:14:08 +00:00
parent 8641da9d1f
commit b370c14d1f
6 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d8/d58/kadane2_8cpp__incl.map
View File

@@ -1,5 +1,5 @@
<map id="dynamic_programming/kadane2.cpp" name="dynamic_programming/kadane2.cpp">
<area shape="rect" id="node1" title="Implementation of [Kadane Algorithm] (https://en.wikipedia.org/wiki/Kadane%27s_algorithm)" alt="" coords="34,5,187,45"/>
<area shape="rect" id="node1" title="Implementation of Kadane Algorithm" alt="" coords="34,5,187,45"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,93,56,119"/>
<area shape="rect" id="node3" title=" " alt="" coords="81,93,141,119"/>
<area shape="rect" id="node4" title=" " alt="" coords="165,93,237,119"/>

2
d8/d58/kadane2_8cpp__incl.md5
View File

@@ -1 +1 @@
756e7f5bb3809b32b99320915302d54d
91a67bd6144dced7a5dd796593b3ba64

2
d8/d58/kadane2_8cpp__incl.svg
View File

@@ -11,7 +11,7 @@
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Implementation of [Kadane Algorithm] (https://en.wikipedia.org/wiki/Kadane%27s_algorithm)">
<g id="a_node1"><a xlink:title="Implementation of Kadane Algorithm">
<polygon fill="#999999" stroke="#666666" points="136.5,-85 21.5,-85 21.5,-55 136.5,-55 136.5,-85"/>
<text text-anchor="start" x="29.5" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="79" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">/kadane2.cpp</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

4
db/dca/kadane2_8cpp.html
View File

@@ -104,7 +104,7 @@ $(document).ready(function(){initNavTree('db/dca/kadane2_8cpp.html','../../'); i
</div><!--header-->
<div class="contents">
<p>Implementation of [Kadane Algorithm] (<a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm">https://en.wikipedia.org/wiki/Kadane%27s_algorithm</a>)
<p>Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;climits&gt;</code><br />
@@ -136,7 +136,7 @@ Functions</h2></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 >Implementation of [Kadane Algorithm] (<a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm">https://en.wikipedia.org/wiki/Kadane%27s_algorithm</a>) </p>
<div class="textblock"><p >Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> </p>
<p >Kadane algorithm is used to find the maximum sum subarray in an array and maximum sum subarray problem is the task of finding a contiguous subarray with the largest sum</p>
<h3><a class="anchor" id="autotoc_md70"></a>
Algorithm</h3>

2
dir_8a20dd5bfd5341a725342bf72b6b686f.html
View File

@@ -119,7 +119,7 @@ Files</h2></td></tr>
<tr class="memdesc:d6/d26/house__robber_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dca/kadane2_8cpp.html">kadane2.cpp</a></td></tr>
<tr class="memdesc:db/dca/kadane2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [Kadane Algorithm] (<a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm">https://en.wikipedia.org/wiki/Kadane%27s_algorithm</a>) <br /></td></tr>
<tr class="memdesc:db/dca/kadane2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html">longest_increasing_subsequence.cpp</a></td></tr>
<tr class="memdesc:d7/d57/longest__increasing__subsequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array. <br /></td></tr>

2
files.html
View File

@@ -167,7 +167,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_6_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d31/coin__change__topdown_8cpp.html" target="_self">coin_change_topdown.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/coin-change/" target="_blank">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount </td></tr>
<tr id="row_6_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d10/cut__rod_8cpp.html" target="_self">cut_rod.cpp</a></td><td class="desc">Implementation of cutting a rod problem </td></tr>
<tr id="row_6_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d26/house__robber_8cpp.html" target="_self">house_robber.cpp</a></td><td class="desc">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm </td></tr>
<tr id="row_6_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dca/kadane2_8cpp.html" target="_self">kadane2.cpp</a></td><td class="desc">Implementation of [Kadane Algorithm] (<a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm">https://en.wikipedia.org/wiki/Kadane%27s_algorithm</a>) </td></tr>
<tr id="row_6_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dca/kadane2_8cpp.html" target="_self">kadane2.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> </td></tr>
<tr id="row_6_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html" target="_self">longest_increasing_subsequence.cpp</a></td><td class="desc">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array </td></tr>
<tr id="row_6_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html" target="_self">longest_palindromic_subsequence.cpp</a></td><td class="desc">Program to find the Longest Palindormic Subsequence of a string </td></tr>
<tr id="row_6_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d52/minimum__edit__distance_8cpp.html" target="_self">minimum_edit_distance.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing </td></tr>