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

Documentation for 7b92e8d625

Browse Source
This commit is contained in:
github-actions
2020-10-31 06:19:31 +00:00
parent edf60a14ca
commit 692390090b
204 changed files with 5501 additions and 4718 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
files.html
View File

@@ -130,11 +130,12 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze</a> algorithm </td></tr>
<tr id="row_2_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9658;</span><span id="img_3_" class="iconfclosed" onclick="toggleFolder('3_')">&#160;</span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>
<tr id="row_3_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="db/d16/0__1__knapsack_8cpp.html" target="_self">0_1_knapsack.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Knapsack_problem">0-1 Knapsack Problem</a> </td></tr>
<tr id="row_3_1_" 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="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_3_2_" 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="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">Kadane Algorithm</a> </td></tr>
<tr id="row_3_3_" 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="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
<tr id="row_3_4_" 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="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_3_5_" 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="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/">Word Break Problem</a> </td></tr>
<tr id="row_3_1_" 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="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/">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_3_2_" 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="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_3_3_" 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="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">Kadane Algorithm</a> </td></tr>
<tr id="row_3_4_" 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="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
<tr id="row_3_5_" 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="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_3_6_" 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="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/">Word Break Problem</a> </td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9658;</span><span id="img_4_" class="iconfclosed" onclick="toggleFolder('4_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
<tr id="row_4_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html" target="_self">jarvis_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm </td></tr>
<tr id="row_4_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html" target="_self">line_segment_intersection.cpp</a></td><td class="desc">Check whether two line segments intersect each other or not </td></tr>