mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 21:01:50 +08:00
Documentation for 78fbb40e9d
This commit is contained in:
github-actions
@@ -257,7 +257,7 @@ template<size_t V> </div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Checks if it's possible to place a 'no' </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<p>Checks if it's possible to place a number 'no' </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">V</td><td>number of vertices in the array </td></tr>
|
||||
</table>
|
||||
@@ -276,17 +276,17 @@ template<size_t V> </div>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if 'mat' is different from 'no' </dd>
|
||||
<dd>
|
||||
<code>false</code> if 'mat' equals to 'no' </dd></dl>
|
||||
<p>Row or col nahin hona chahiye</p>
|
||||
<p>Subgrid mein nahi hona chahiye</p>
|
||||
<p>'no' shouldn't be present in either row i or column j</p>
|
||||
<p>'no' shouldn't be present in the 3*3 subgrid</p>
|
||||
<div class="fragment"><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> /// Row or col nahin hona chahiye</span></div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> /// 'no' shouldn't be present in either row i or column j</span></div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < n; x++) {</div>
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (mat[x][j] == no || mat[i][x] == no) {</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> /// Subgrid mein nahi hona chahiye</span></div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> /// 'no' shouldn't be present in the 3*3 subgrid</span></div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"></span> <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
||||
@@ -760,17 +760,17 @@ template<size_t V> </div>
|
||||
<dd>
|
||||
<code>false</code> if 'no' was not placed </dd></dl>
|
||||
<p>Base Case</p>
|
||||
<p>Solve kr chuke hain for 9 rows already</p>
|
||||
<p>Solved for 9 rows already</p>
|
||||
<p>Crossed the last Cell in the row</p>
|
||||
<p>Blue Cell - Skip</p>
|
||||
<p>White Cell Try to place every possible no</p>
|
||||
<p>Place the no - assuming solution aa jayega</p>
|
||||
<p>Nahin solve hui loop will place the next no.</p>
|
||||
<p>Sare no try kr liey, kisi se bhi solve nahi hui</p>
|
||||
<p>Place the 'no' - assuming a solution will exist</p>
|
||||
<p>Couldn't find a solution loop will place the next no.</p>
|
||||
<p><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> couldn't be found for any of the numbers provided</p>
|
||||
<div class="fragment"><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> /// Base Case</span></div>
|
||||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"></span> <span class="keywordflow">if</span> (i == 9) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> /// Solve kr chuke hain for 9 rows already</span></div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> /// Solved for 9 rows already</span></div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"></span> backtracking::printMat<V>(mat, 9);</div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
|
||||
@@ -788,17 +788,17 @@ template<size_t V> </div>
|
||||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> /// Try to place every possible no</span></div>
|
||||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no <= 9; no++) {</div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (backtracking::isPossible<V>(mat, i, j, no, 9)) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> /// Place the no - assuming solution aa jayega</span></div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> /// Place the 'no' - assuming a solution will exist</span></div>
|
||||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"></span> mat[i][j] = no;</div>
|
||||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordtype">bool</span> aageKiSolveHui = backtracking::solveSudoku<V>(mat, i, j + 1);</div>
|
||||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (aageKiSolveHui) {</div>
|
||||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordtype">bool</span> solution_found = backtracking::solveSudoku<V>(mat, i, j + 1);</div>
|
||||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (solution_found) {</div>
|
||||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> /// Nahin solve hui</span></div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> /// Couldn't find a solution</span></div>
|
||||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> /// loop will place the next no.</span></div>
|
||||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"></span> }</div>
|
||||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> /// Sare no try kr liey, kisi se bhi solve nahi hui</span></div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> /// Solution couldn't be found for any of the numbers provided</span></div>
|
||||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"></span> mat[i][j] = 0;</div>
|
||||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div>
|
||||
|
||||
@@ -132,7 +132,7 @@ Functions</h2></td></tr>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm">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_md44"></a>
|
||||
<h3><a class="anchor" id="autotoc_md51"></a>
|
||||
Algorithm</h3>
|
||||
<p>The simple idea of the algorithm is to search for all positive contiguous segments of the array and keep track of maximum sum contiguous segment among all positive segments(curr_sum is used for this) Each time we get a positive sum we compare it with max_sum and update max_sum if it is greater than curr_sum</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ayush523">Ayush Singh</a> </dd></dl>
|
||||
|
||||
Reference in New Issue
Block a user