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

Documentation for 3741b41a8a

Browse Source
This commit is contained in:
github-actions
2020-08-17 13:40:42 +00:00
parent 1d4d7d2c6c
commit 2d5dfb6d54
188 changed files with 5793 additions and 4840 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
namespaces.html
View File

@@ -101,22 +101,24 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
<tr id="row_2_" 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/d4e/namespaceciphers.html" target="_self">ciphers</a></td><td class="desc">Algorithms for encryption and decryption </td></tr>
<tr id="row_3_"><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="d1/db4/namespacedata__structure.html" target="_self">data_structure</a></td><td class="desc">Data-structure algorithms </td></tr>
<tr id="row_4_" 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/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing">double hashing</a> algorithm </td></tr>
<tr id="row_5_"><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/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">Geometry algorithms </td></tr>
<tr id="row_6_" 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/dce/namespacegraph.html" target="_self">graph</a></td><td class="desc"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms </td></tr>
<tr id="row_7_"><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="de/d83/namespaceis__graph__bipartite.html" target="_self">is_graph_bipartite</a></td><td class="desc">Functions for checking whether a graph is bipartite or not </td></tr>
<tr id="row_8_" 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="d5/da7/namespacejarvis.html" target="_self">jarvis</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm </td></tr>
<tr id="row_9_"><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/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing</a> algorithm </td></tr>
<tr id="row_10_" 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/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc">Machine learning algorithms </td></tr>
<tr id="row_11_"><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/da1/namespacen__queens.html" target="_self">n_queens</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle">Eight Queens</a> puzzle </td></tr>
<tr id="row_12_" 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="d2/d3b/namespaceqr__algorithm.html" target="_self">qr_algorithm</a></td><td class="desc">Functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> of any rectangular matrix </td></tr>
<tr id="row_13_"><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/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
<tr id="row_14_" 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="d5/d91/namespacesorting.html" target="_self">sorting</a></td><td class="desc">Sorting algorithms </td></tr>
<tr id="row_15_"><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="da/dd3/namespacespirograph.html" target="_self">spirograph</a></td><td class="desc"></td></tr>
<tr id="row_16_" 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="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_17_"><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/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
<tr id="row_18_" 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/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
<tr id="row_19_"><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_20_" 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>
<tr id="row_5_"><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="dd/d24/namespacedynamic__programming.html" target="_self">dynamic_programming</a></td><td class="desc">Dynamic Programming algorithms </td></tr>
<tr id="row_6_" 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="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">Geometry algorithms </td></tr>
<tr id="row_7_"><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/dce/namespacegraph.html" target="_self">graph</a></td><td class="desc"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms </td></tr>
<tr id="row_8_" 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="de/d83/namespaceis__graph__bipartite.html" target="_self">is_graph_bipartite</a></td><td class="desc">Functions for checking whether a graph is bipartite or not </td></tr>
<tr id="row_9_"><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/da7/namespacejarvis.html" target="_self">jarvis</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm </td></tr>
<tr id="row_10_" 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/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing</a> algorithm </td></tr>
<tr id="row_11_"><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/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc">Machine learning algorithms </td></tr>
<tr id="row_12_" 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/da1/namespacen__queens.html" target="_self">n_queens</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle">Eight Queens</a> puzzle </td></tr>
<tr id="row_13_"><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/d3b/namespaceqr__algorithm.html" target="_self">qr_algorithm</a></td><td class="desc">Functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition">QR decomposition</a> of any rectangular matrix </td></tr>
<tr id="row_14_" 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/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
<tr id="row_15_"><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_16_" 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="d5/d91/namespacesorting.html" target="_self">sorting</a></td><td class="desc">Sorting algorithms </td></tr>
<tr id="row_17_"><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="da/dd3/namespacespirograph.html" target="_self">spirograph</a></td><td class="desc"></td></tr>
<tr id="row_18_" 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="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_19_"><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/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
<tr id="row_20_" 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/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
<tr id="row_21_"><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_22_" 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 -->