backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-31 09:13:16 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 1a1570d775

Browse Source
This commit is contained in:
github-actions
2023-04-28 14:48:59 +00:00
parent ffdd173f0d
commit 7312767170
3827 changed files with 57379 additions and 55777 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
files.html
View File

@@ -156,13 +156,14 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_4_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="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear [<a class="el" href="dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>) </td></tr>
<tr id="row_4_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="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
<tr id="row_4_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="d6/d05/reverse__a__linked__list_8cpp.html" target="_self">reverse_a_linked_list.cpp</a></td><td class="desc">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </td></tr>
<tr id="row_4_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="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_4_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="d6/d42/data__structures_2sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code>min()</code> function </td></tr>
<tr id="row_4_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d47/stack_8hpp.html" target="_self">stack.hpp</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_4_20_" 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/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
<tr id="row_4_21_" 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="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_4_22_" 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/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" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_4_23_" 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="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
<tr id="row_4_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="de/dd1/segment__tree_8cpp.html" target="_self">segment_tree.cpp</a></td><td class="desc">A data structure to quickly do operations on ranges: the <a href="https://en.wikipedia.org/wiki/Segment_tree" target="_blank">Segment Tree</a> algorithm implementation </td></tr>
<tr id="row_4_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="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_4_19_" 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/d42/data__structures_2sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code>min()</code> function </td></tr>
<tr id="row_4_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d47/stack_8hpp.html" target="_self">stack.hpp</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_4_21_" 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/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
<tr id="row_4_22_" 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="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_4_23_" 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/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" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_4_24_" 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="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9658;</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')">&#160;</span><a class="el" href="dir_93bc990c5cceb745f78af6949e9ef947.html" target="_self">divide_and_conquer</a></td><td class="desc"></td></tr>
<tr id="row_5_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="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html" target="_self">karatsuba_algorithm_for_fast_multiplication.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">&#9658;</span><span id="img_6_" class="iconfclosed" onclick="toggleFolder('6_')">&#160;</span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>