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

Documentation for 97afa0e3e4

Browse Source
This commit is contained in:
github-actions
2021-07-07 09:31:13 +00:00
parent c3c01456fb
commit aa1fcb378c
309 changed files with 8430 additions and 5960 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
namespaces.html
View File

@@ -236,7 +236,11 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/de7/namespacerunge__kutta.html" target="_self">runge_kutta</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods">Runge Kutta fourth order</a> method </td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dda/namespacesaddleback.html" target="_self">saddleback</a></td><td class="desc">Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a> </td></tr>
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">Search algorithms </td></tr>
<tr id="row_65_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_65_" class="arrow" onclick="toggleFolder('65_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">Search algorithms </td></tr>
<tr id="row_65_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><b>median_search</b></td><td class="desc"></td></tr>
<tr id="row_65_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><b>saddleback</b></td><td class="desc"></td></tr>
<tr id="row_65_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_65_2_" class="arrow" onclick="toggleFolder('65_2_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
<tr id="row_65_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/deb/namespaceshortest__common__supersequence.html" target="_self">shortest_common_supersequence</a></td><td class="desc">Shortest Common Super Sequence algorithm </td></tr>
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d91/namespacesorting.html" target="_self">sorting</a></td><td class="desc">Sorting algorithms </td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d55/namespacesparse__table.html" target="_self">sparse_table</a></td><td class="desc">Functions for Implementation of <a href="https://brilliant.org/wiki/sparse-table/">Sparse Table</a> </td></tr>
@@ -258,15 +262,16 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort">Strand Sort</a> algorithm </td></tr>
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">Algorithms with strings </td></tr>
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree">2–3–4 tree</a> </td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/">Trie datastructure</a> implementation </td></tr>
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie">Trie</a> data structure using hashmap implementation </td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
<tr id="row_79_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher">vigenère cipher</a> algorithm </td></tr>
<tr id="row_81_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/">Wiggle Sort</a> algorithm </td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/">Word Break</a> problem </td></tr>
<tr id="row_83_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher">XOR cipher</a> algorithm </td></tr>
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search</a> implementation </td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree">2–3–4 tree</a> </td></tr>
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/">Trie datastructure</a> implementation </td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie">Trie</a> data structure using hashmap implementation </td></tr>
<tr id="row_79_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
<tr id="row_81_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher">vigenère cipher</a> algorithm </td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/">Wiggle Sort</a> algorithm </td></tr>
<tr id="row_83_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/">Word Break</a> problem </td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher">XOR cipher</a> algorithm </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->