Documentation for 5fd64423de

d1/d85/unbounded__0__1__knapsack_8cpp__incl.map

@@ -1,5 +1,5 @@
-<map id="dynamic_programming/Unbounded_0_1_Knapsack.cpp" name="dynamic_programming/Unbounded_0_1_Knapsack.cpp">
-<area shape="rect" id="Node000001" title="Implementation of the Unbounded 0/1 Knapsack Problem." alt="" coords="67,5,276,46"/>
+<map id="dynamic_programming/unbounded_0_1_knapsack.cpp" name="dynamic_programming/unbounded_0_1_knapsack.cpp">
+<area shape="rect" id="Node000001" title="Implementation of the Unbounded 0/1 Knapsack Problem." alt="" coords="70,5,274,46"/>
 <area shape="rect" id="Node000002" title=" " alt="" coords="5,94,77,120"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="140,49,75,88,72,83,138,44"/>
 <area shape="rect" id="Node000003" title=" " alt="" coords="100,94,158,120"/>

d1/d85/unbounded__0__1__knapsack_8cpp__incl.md5

@@ -0,0 +1 @@
+58458697f53a27e81fff0097907f30e3

d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg

@@ -3,7 +3,7 @@
  "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
-<!-- Title: dynamic_programming/Unbounded_0_1_Knapsack.cpp Pages: 1 -->
+<!-- Title: dynamic_programming/unbounded_0_1_knapsack.cpp Pages: 1 -->
 <svg width="252pt" height="94pt"
  viewBox="0.00 0.00 252.38 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
@@ -18,14 +18,14 @@
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
 <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
-<title>dynamic_programming/Unbounded_0_1_Knapsack.cpp</title>
+<title>dynamic_programming/unbounded_0_1_knapsack.cpp</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Implementation of the Unbounded 0/1 Knapsack Problem.">
-<polygon fill="#999999" stroke="#666666" points="203.25,-85.75 46.25,-85.75 46.25,-55.25 203.25,-55.25 203.25,-85.75"/>
-<text text-anchor="start" x="54.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="124.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/Unbounded_0_1_Knapsack.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="201.38,-85.75 48.12,-85.75 48.12,-55.25 201.38,-55.25 201.38,-85.75"/>
+<text text-anchor="start" x="56.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
+<text text-anchor="middle" x="124.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/unbounded_0_1_knapsack.cpp</text>
 </a>
 </g>
 </g>

d1/d85/unbounded__0__1__knapsack_8cpp__incl_org.svg

@@ -3,18 +3,18 @@
  "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
-<!-- Title: dynamic_programming/Unbounded_0_1_Knapsack.cpp Pages: 1 -->
+<!-- Title: dynamic_programming/unbounded_0_1_knapsack.cpp Pages: 1 -->
 <svg width="252pt" height="94pt"
  viewBox="0.00 0.00 252.38 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
-<title>dynamic_programming/Unbounded_0_1_Knapsack.cpp</title>
+<title>dynamic_programming/unbounded_0_1_knapsack.cpp</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Implementation of the Unbounded 0/1 Knapsack Problem.">
-<polygon fill="#999999" stroke="#666666" points="203.25,-85.75 46.25,-85.75 46.25,-55.25 203.25,-55.25 203.25,-85.75"/>
-<text text-anchor="start" x="54.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="124.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/Unbounded_0_1_Knapsack.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="201.38,-85.75 48.12,-85.75 48.12,-55.25 201.38,-55.25 201.38,-85.75"/>
+<text text-anchor="start" x="56.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
+<text text-anchor="middle" x="124.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/unbounded_0_1_knapsack.cpp</text>
 </a>
 </g>
 </g>

d4/dac/_unbounded__0__1___knapsack_8cpp__incl.md5

@@ -1 +0,0 @@
-713fd7bc9b8cb2150527bffad05e42f6

d5/d88/md__d_i_r_e_c_t_o_r_y.html

@@ -293,6 +293,7 @@ Graphics</h1>
 <h1><a class="anchor" id="autotoc_md56"></a>
 Greedy Algorithms</h1>
 <ul>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/binary_addition.cpp" target="_blank">Binary Addition</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/boruvkas_minimum_spanning_tree.cpp" target="_blank">Boruvkas Minimum Spanning Tree</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/digit_separation.cpp" target="_blank">Digit Separation</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/dijkstra.cpp" target="_blank">Dijkstra</a></li>
@@ -449,6 +450,7 @@ Others</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/lfu_cache.cpp" target="_blank">Lfu Cache</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/longest_substring_without_repeating_characters.cpp" target="_blank">Longest Substring Without Repeating Characters</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/lru_cache.cpp" target="_blank">Lru Cache</a></li>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/lru_cache2.cpp" target="_blank">Lru Cache2</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/matrix_exponentiation.cpp" target="_blank">Matrix Exponentiation</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/palindrome_of_number.cpp" target="_blank">Palindrome Of Number</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/others/paranthesis_matching.cpp" target="_blank">Paranthesis Matching</a></li>
@@ -493,7 +495,6 @@ Range Queries</h1>
 <h1><a class="anchor" id="autotoc_md66"></a>
 Search</h1>
 <ul>
-<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/Longest_Increasing_Subsequence_using_binary_search.cpp" target="_blank">Longest Increasing Subsequence Using Binary Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/binary_search.cpp" target="_blank">Binary Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/exponential_search.cpp" target="_blank">Exponential Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/fibonacci_search.cpp" target="_blank">Fibonacci Search</a></li>
@@ -503,6 +504,7 @@ Search</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/interpolation_search2.cpp" target="_blank">Interpolation Search2</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/jump_search.cpp" target="_blank">Jump Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/linear_search.cpp" target="_blank">Linear Search</a></li>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/longest_increasing_subsequence_using_binary_search.cpp" target="_blank">Longest Increasing Subsequence Using Binary Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/median_search.cpp" target="_blank">Median Search</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/median_search2.cpp" target="_blank">Median Search2</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/search/saddleback_search.cpp" target="_blank">Saddleback Search</a></li>

d7/dcb/_unbounded__0__1___knapsack_8cpp.js

@@ -1,7 +0,0 @@
-var _unbounded__0__1___knapsack_8cpp =
-[
-    [ "KnapSackFilling", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c", null ],
-    [ "main", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
-    [ "tests", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ],
-    [ "unboundedKnapsack", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef", null ]
-];

d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5

@@ -1 +0,0 @@
-e633f32aa5bcb22cef86b8413bf5da4d

d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5

@@ -1 +0,0 @@
-64030173c1469536f82600ba0240eb99

d9/dec/unbounded__0__1__knapsack_8cpp.html

@@ -5,7 +5,7 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/Unbounded_0_1_Knapsack.cpp File Reference</title>
+<title>Algorithms_in_C++: dynamic_programming/unbounded_0_1_knapsack.cpp File Reference</title>
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
@@ -78,7 +78,7 @@ $(function() {
 </div>
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-$(function(){initNavTree('d7/dcb/_unbounded__0__1___knapsack_8cpp.html','../../'); initResizable(true); });
+$(function(){initNavTree('d9/dec/unbounded__0__1__knapsack_8cpp.html','../../'); initResizable(true); });
 /* @license-end */
 </script>
 <div id="doc-content">
@@ -107,7 +107,7 @@ $(function(){initNavTree('d7/dcb/_unbounded__0__1___knapsack_8cpp.html','../../'
   <div class="summary">
 <a href="#namespaces">Namespaces</a> &#124;
 <a href="#func-members">Functions</a>  </div>
-  <div class="headertitle"><div class="title">Unbounded_0_1_Knapsack.cpp File Reference</div></div>
+  <div class="headertitle"><div class="title">unbounded_0_1_knapsack.cpp File Reference</div></div>
 </div><!--header-->
 <div class="contents">
 
@@ -118,9 +118,9 @@ $(function(){initNavTree('d7/dcb/_unbounded__0__1___knapsack_8cpp.html','../../'
 <code>#include &lt;cassert&gt;</code><br />
 <code>#include &lt;cstdint&gt;</code><br />
 </div><div class="textblock"><div class="dynheader">
-Include dependency graph for Unbounded_0_1_Knapsack.cpp:</div>
+Include dependency graph for unbounded_0_1_knapsack.cpp:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dac/_unbounded__0__1___knapsack_8cpp__incl.svg" width="336" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg" width="336" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
 </div><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
@@ -233,13 +233,13 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   74</span>    }</div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][W] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(take, nottake); <span class="comment">// Store and return the maximum value</span></div>
 <div class="line"><span class="lineno">   76</span>}</div>
-<div class="ttc" id="a_unbounded__0__1___knapsack_8cpp_html_afe447a5979582174908695952c8a079c"><div class="ttname"><a href="#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a></div><div class="ttdeci">std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt, std::vector&lt; std::vector&lt; int &gt; &gt; &amp;dp)</div><div class="ttdoc">Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.</div><div class="ttdef"><b>Definition</b> Unbounded_0_1_Knapsack.cpp:57</div></div>
 <div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
 <div class="ttc" id="anamespacedp_html"><div class="ttname"><a href="../../df/d88/namespacedp.html">dp</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> partition_problem.cpp:39</div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_afe447a5979582174908695952c8a079c"><div class="ttname"><a href="#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a></div><div class="ttdeci">std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt, std::vector&lt; std::vector&lt; int &gt; &gt; &amp;dp)</div><div class="ttdoc">Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.</div><div class="ttdef"><b>Definition</b> unbounded_0_1_knapsack.cpp:57</div></div>
 </div><!-- fragment --><div class="dynheader">
 Here is the call graph for this function:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dcb/_unbounded__0__1___knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg" width="287" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg" width="287" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
 
 </div>
@@ -265,11 +265,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  148</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// Run self test implementation </span></div>
 <div class="line"><span class="lineno">  149</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  150</span>}</div>
-<div class="ttc" id="a_unbounded__0__1___knapsack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> Unbounded_0_1_Knapsack.cpp:103</div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> unbounded_0_1_knapsack.cpp:103</div></div>
 </div><!-- fragment --><div class="dynheader">
 Here is the call graph for this function:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dcb/_unbounded__0__1___knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
 
 </div>
@@ -338,15 +338,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
 <div class="line"><span class="lineno">  140</span> </div>
 <div class="line"><span class="lineno">  141</span>}</div>
-<div class="ttc" id="a_unbounded__0__1___knapsack_8cpp_html_a1bcff7f76de48fa7f629480f8f18b5ef"><div class="ttname"><a href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a></div><div class="ttdeci">std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt)</div><div class="ttdoc">Wrapper function to initiate the unbounded knapsack calculation.</div><div class="ttdef"><b>Definition</b> Unbounded_0_1_Knapsack.cpp:87</div></div>
 <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
 <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
 <div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a></div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a1bcff7f76de48fa7f629480f8f18b5ef"><div class="ttname"><a href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a></div><div class="ttdeci">std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt)</div><div class="ttdoc">Wrapper function to initiate the unbounded knapsack calculation.</div><div class="ttdef"><b>Definition</b> unbounded_0_1_knapsack.cpp:87</div></div>
 <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment --><div class="dynheader">
 Here is the call graph for this function:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dcb/_unbounded__0__1___knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
 
 </div>
@@ -399,7 +399,7 @@ Here is the call graph for this function:</div>
 </div><!-- fragment --><div class="dynheader">
 Here is the call graph for this function:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dcb/_unbounded__0__1___knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg" width="490" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg" width="490" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
 
 </div>
@@ -409,7 +409,7 @@ Here is the call graph for this function:</div>
 <!-- start footer part -->
 <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="../../d7/dcb/_unbounded__0__1___knapsack_8cpp.html">Unbounded_0_1_Knapsack.cpp</a></li>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.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>
   </ul>
 </div>

d9/dec/unbounded__0__1__knapsack_8cpp.js

@@ -0,0 +1,7 @@
+var unbounded__0__1__knapsack_8cpp =
+[
+    [ "KnapSackFilling", "d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c", null ],
+    [ "main", "d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+    [ "tests", "d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ],
+    [ "unboundedKnapsack", "d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef", null ]
+];

d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map

@@ -1,7 +1,7 @@
 <map id="dynamic_programming::unbounded_knapsack::unboundedKnapsack" name="dynamic_programming::unbounded_knapsack::unboundedKnapsack">
 <area shape="rect" id="Node000001" title="Wrapper function to initiate the unbounded knapsack calculation." alt="" coords="5,29,161,85"/>
 <area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="43,29,43,19,51,10,64,5,83,3,105,5,118,12,115,17,103,10,83,8,65,10,54,15,48,21,48,29"/>
-<area shape="rect" id="Node000002" href="$d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c" title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach." alt="" coords="209,29,364,85"/>
+<area shape="rect" id="Node000002" href="$d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c" title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach." alt="" coords="209,29,364,85"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,54,193,54,193,60,161,60"/>
 <area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="254,29,254,19,260,10,271,5,286,3,303,5,314,12,311,16,302,10,286,8,272,10,264,14,259,21,259,29"/>
 <area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="412,44,484,70"/>

d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5

@@ -0,0 +1 @@
+2ea70cc9a7326aa2107dae6f120e7207

d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg

@@ -42,7 +42,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c" target="_top" xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
+<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c" target="_top" xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
 <polygon fill="white" stroke="#666666" points="269,-41.75 152.5,-41.75 152.5,0 269,0 269,-41.75"/>
 <text text-anchor="start" x="160.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
 <text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>

d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg

@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c" target="_top" xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
+<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c" target="_top" xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
 <polygon fill="white" stroke="#666666" points="269,-41.75 152.5,-41.75 152.5,0 269,0 269,-41.75"/>
 <text text-anchor="start" x="160.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
 <text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>

d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map

@@ -1,6 +1,6 @@
 <map id="main" name="main">
 <area shape="rect" id="Node000001" title="main function" alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="self test implementation" alt="" coords="103,5,153,31"/>
+<area shape="rect" id="Node000002" href="$d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="self test implementation" alt="" coords="103,5,153,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
 <area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,16,185,16,185,21,153,21"/>

d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5

@@ -0,0 +1 @@
+c409a1a966c43cec22ad0eeaf0d32ac0

d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
+<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
 <polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
 <text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
 </a>

d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg

@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
+<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
 <polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
 <text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
 </a>

dir_8a20dd5bfd5341a725342bf72b6b686f.html

@@ -161,8 +161,8 @@ Files</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d80/trapped__rainwater_8cpp.html">trapped_rainwater.cpp</a></td></tr>
 <tr class="memdesc:d9/d80/trapped__rainwater_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</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"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html">Unbounded_0_1_Knapsack.cpp</a></td></tr>
-<tr class="memdesc:d7/dcb/_unbounded__0__1___knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem. <br /></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.cpp</a></td></tr>
+<tr class="memdesc:d9/dec/unbounded__0__1__knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d84/word__break_8cpp.html">word_break.cpp</a></td></tr>
 <tr class="memdesc:d3/d84/word__break_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> <br /></td></tr>

dir_8a20dd5bfd5341a725342bf72b6b686f.js

@@ -17,6 +17,6 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f =
     [ "shortest_common_supersequence.cpp", "d7/d65/shortest__common__supersequence_8cpp.html", "d7/d65/shortest__common__supersequence_8cpp" ],
     [ "subset_sum.cpp", "d6/d80/dynamic__programming_2subset__sum_8cpp.html", "d6/d80/dynamic__programming_2subset__sum_8cpp" ],
     [ "trapped_rainwater.cpp", "d9/d80/trapped__rainwater_8cpp.html", "d9/d80/trapped__rainwater_8cpp" ],
-    [ "Unbounded_0_1_Knapsack.cpp", "d7/dcb/_unbounded__0__1___knapsack_8cpp.html", "d7/dcb/_unbounded__0__1___knapsack_8cpp" ],
+    [ "unbounded_0_1_knapsack.cpp", "d9/dec/unbounded__0__1__knapsack_8cpp.html", "d9/dec/unbounded__0__1__knapsack_8cpp" ],
     [ "word_break.cpp", "d3/d84/word__break_8cpp.html", "d3/d84/word__break_8cpp" ]
 ];

doxygen_crawl.html

@@ -99,7 +99,7 @@
 <a href="d5/d90/palindrome__partitioning_8cpp.html"/>
 <a href="d7/d65/shortest__common__supersequence_8cpp.html"/>
 <a href="d9/d80/trapped__rainwater_8cpp.html"/>
-<a href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp.html"/>
 <a href="d3/d84/word__break_8cpp.html"/>
 <a href="dd/d92/memory__game_8cpp.html"/>
 <a href="d4/d8d/jarvis__algorithm_8cpp.html"/>
@@ -2425,11 +2425,6 @@
 <a href="d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d7/dba/cll_8h_source.html"/>
 <a href="d7/dc1/namespacemath_1_1fibonacci.html#aeaaf5439cb29de4630c7dff2fd914b28"/>
-<a href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html"/>
-<a href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef"/>
-<a href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
-<a href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
-<a href="d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c"/>
 <a href="d7/de3/namespacemath_1_1monte__carlo.html#a71249ee535f16f8ed2e9cc8f0199a2cf"/>
 <a href="d7/de3/namespacemath_1_1monte__carlo.html#af7da9ba8932f1f48b9bbc2d80471af51"/>
 <a href="d7/ded/queue_8hpp_source.html"/>
@@ -2911,6 +2906,11 @@
 <a href="d9/dde/structdouble__hashing_1_1_entry.html"/>
 <a href="d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475"/>
 <a href="d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp.html"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c"/>
 <a href="d9/dee/classdouble__linked__list.html"/>
 <a href="d9/def/namespacesublist__search.html"/>
 <a href="d9/df0/fast__integer__input_8cpp.html"/>

files.html

@@ -194,7 +194,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
 <tr id="row_6_14_" 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/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
 <tr id="row_6_15_" 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/d80/dynamic__programming_2subset__sum_8cpp.html" target="_self">subset_sum.cpp</a></td><td class="desc">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not </td></tr>
 <tr id="row_6_16_" 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/d80/trapped__rainwater_8cpp.html" target="_self">trapped_rainwater.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> </td></tr>
-<tr id="row_6_17_" 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/dcb/_unbounded__0__1___knapsack_8cpp.html" target="_self">Unbounded_0_1_Knapsack.cpp</a></td><td class="desc">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem </td></tr>
+<tr id="row_6_17_" 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/dec/unbounded__0__1__knapsack_8cpp.html" target="_self">unbounded_0_1_knapsack.cpp</a></td><td class="desc">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem </td></tr>
 <tr id="row_6_18_" 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="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
 <tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="dynsection.toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="dynsection.toggleFolder('7_')">&#160;</span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
 <tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d92/memory__game_8cpp.html" target="_self">memory_game.cpp</a></td><td class="desc">A simple <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> with <b>3 different sizes</b> and multiple letters </td></tr>

navtreedata.js

@@ -144,9 +144,9 @@ var NAVTREEINDEX =
 "d4/d3e/n__queens_8cpp.html",
 "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56",
 "d6/d4e/namespaceciphers.html",
-"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e",
-"d8/d9c/union__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d",
-"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff",
+"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d",
+"d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669",
+"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb",
 "db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0",
 "dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a",
 "dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b",

navtreeindex10.js

@@ -1,10 +1,5 @@
 var NAVTREEINDEX10 =
 {
-"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff":[10,0,21,9],
-"d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[10,0,21,3],
-"d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[10,0,21,4],
-"d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[10,0,21,12],
-"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[10,0,21,17],
 "d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[10,0,21,14],
 "d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[10,0,21,11],
 "d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[10,0,21,19],
@@ -20,6 +15,11 @@ var NAVTREEINDEX10 =
 "d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[10,0,4,0,0],
 "d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,26,0,1],
 "d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[10,0,4,0,1],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html":[11,0,6,17],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef":[11,0,6,17,3],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,17,2],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,17,1],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c":[11,0,6,17,0],
 "d9/dee/classdouble__linked__list.html":[10,0,29],
 "d9/def/namespacesublist__search.html":[9,0,125],
 "d9/df0/fast__integer__input_8cpp.html":[11,0,17,4],

navtreeindex7.js

@@ -248,6 +248,6 @@ var NAVTREEINDEX7 =
 "d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,4,1],
 "d7/dba/cll_8h_source.html":[11,0,4,0,0],
 "d7/dbf/namespacestd_1_1this__thread.html":[9,0,118,4],
-"d7/dcb/_unbounded__0__1___knapsack_8cpp.html":[11,0,6,17],
-"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef":[11,0,6,17,3]
+"d7/ded/queue_8hpp_source.html":[11,0,4,13],
+"d7/def/trie__multiple__search_8cpp.html":[11,0,16,6]
 };

navtreeindex8.js

@@ -1,10 +1,5 @@
 var NAVTREEINDEX8 =
 {
-"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,17,2],
-"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,17,1],
-"d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c":[11,0,6,17,0],
-"d7/ded/queue_8hpp_source.html":[11,0,4,13],
-"d7/def/trie__multiple__search_8cpp.html":[11,0,16,6],
 "d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,2],
 "d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,6,1],
 "d8/d10/structlist.html":[10,0,39],
@@ -249,5 +244,10 @@ var NAVTREEINDEX8 =
 "d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,6,1],
 "d8/d9c/union__of__two__arrays_8cpp.html":[11,0,16,7],
 "d8/d9c/union__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,7,4],
-"d8/d9c/union__of__two__arrays_8cpp.html#a2b8ff06a84b041457873840bf82e2d74":[11,0,16,7,0]
+"d8/d9c/union__of__two__arrays_8cpp.html#a2b8ff06a84b041457873840bf82e2d74":[11,0,16,7,0],
+"d8/d9c/union__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,7,7],
+"d8/d9c/union__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,7,2],
+"d8/d9c/union__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,7,6],
+"d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,7,3],
+"d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,7,9]
 };

navtreeindex9.js

@@ -1,10 +1,5 @@
 var NAVTREEINDEX9 =
 {
-"d8/d9c/union__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,7,7],
-"d8/d9c/union__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,7,2],
-"d8/d9c/union__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,7,6],
-"d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,7,3],
-"d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,7,9],
 "d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,7,5],
 "d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,7,1],
 "d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,7,8],
@@ -249,5 +244,10 @@ var NAVTREEINDEX9 =
 "d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd":[10,0,21,16],
 "d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0":[10,0,21,5],
 "d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3":[10,0,21,15],
-"d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13":[10,0,21,10]
+"d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13":[10,0,21,10],
+"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff":[10,0,21,9],
+"d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[10,0,21,3],
+"d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[10,0,21,4],
+"d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[10,0,21,12],
+"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[10,0,21,17]
 };

search/all_10.js

@@ -17,7 +17,7 @@ var searchData=
   ['kilo_14',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
   ['kmp_15',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
   ['knapsack_16',['Knapsack',['../d7/daf/namespace_knapsack.html',1,'']]],
-  ['knapsackfilling_17',['KnapSackFilling',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
+  ['knapsackfilling_17',['KnapSackFilling',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
   ['knight_5ftour_18',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]],
   ['knight_5ftour_2ecpp_19',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]],
   ['knn_20',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]],

search/all_1a.js

@@ -27,8 +27,8 @@ var searchData=
   ['uintptr_5ft_24',['uintptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
   ['unary_5ffunction_25',['unary_function',['http://en.cppreference.com/w/cpp/utility/functional/unary_function.html',0,'std']]],
   ['unary_5fnegate_26',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::unary_negate()']]],
-  ['unbounded_5f0_5f1_5fknapsack_2ecpp_27',['Unbounded_0_1_Knapsack.cpp',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html',1,'']]],
-  ['unboundedknapsack_28',['unboundedKnapsack',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
+  ['unbounded_5f0_5f1_5fknapsack_2ecpp_27',['unbounded_0_1_knapsack.cpp',['../d9/dec/unbounded__0__1__knapsack_8cpp.html',1,'']]],
+  ['unboundedknapsack_28',['unboundedKnapsack',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
   ['uncaught_5fexception_29',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]],
   ['undeclare_5fno_5fpointers_30',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]],
   ['undeclare_5freachable_31',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]],

search/all_6.js

@@ -56,7 +56,7 @@ var searchData=
   ['adjacent_5ffind_53',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]],
   ['adopt_5flock_5ft_54',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
   ['advance_55',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]],
-  ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]],
+  ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../db/dca/kadane2_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]],
   ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
   ['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]],
   ['algorithms_59',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]],

search/files_15.js

@@ -2,6 +2,6 @@ var searchData=
 [
   ['uint128_5ft_2ehpp_0',['uint128_t.hpp',['../da/d41/uint128__t_8hpp.html',1,'']]],
   ['uint256_5ft_2ehpp_1',['uint256_t.hpp',['../da/da3/uint256__t_8hpp.html',1,'']]],
-  ['unbounded_5f0_5f1_5fknapsack_2ecpp_2',['Unbounded_0_1_Knapsack.cpp',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html',1,'']]],
+  ['unbounded_5f0_5f1_5fknapsack_2ecpp_2',['unbounded_0_1_knapsack.cpp',['../d9/dec/unbounded__0__1__knapsack_8cpp.html',1,'']]],
   ['union_5fof_5ftwo_5farrays_2ecpp_3',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]]
 ];

search/functions_15.js

@@ -8,7 +8,7 @@ var searchData=
   ['uint256_5ft_5',['uint256_t',['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &&num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]],
   ['uint256_5ft_5ftests_6',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]],
   ['unary_5fnegate_7',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate']]],
-  ['unboundedknapsack_8',['unboundedKnapsack',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
+  ['unboundedknapsack_8',['unboundedKnapsack',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
   ['uncaught_5fexception_9',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]],
   ['undeclare_5fno_5fpointers_10',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]],
   ['undeclare_5freachable_11',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]],

search/functions_b.js

@@ -7,7 +7,7 @@ var searchData=
   ['key_5feq_4',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]],
   ['kill_5fdependency_5',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]],
   ['kmp_6',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
-  ['knapsackfilling_7',['KnapSackFilling',['../d7/dcb/_unbounded__0__1___knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
+  ['knapsackfilling_7',['KnapSackFilling',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
   ['knn_8',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector< std::vector< double > > &X, std::vector< int > &Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &&)=default']]],
   ['knuth_5fb_9',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]],
   ['kohonen_5fsom_10',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]],