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

Documentation for 93a700c7e9

Browse Source
This commit is contained in:
realstealthninja
2025-05-25 14:24:42 +00:00
parent a868ea9b06
commit e7edde96ab
32 changed files with 1083 additions and 1246 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
namespaces.html
View File

@@ -152,7 +152,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });
<tr id="row_21_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><a class="el" href="dd/d2e/namespacedata__structures_1_1treap.html" target="_self">treap</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation </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="d8/da7/namespacedepth__first__search.html" target="_self">depth_first_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search</a> algorithm </td></tr>
<tr id="row_23_" class="odd"><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/db4/namespacedisjoint__union.html" target="_self">disjoint_union</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> implementation </td></tr>
<tr id="row_24_" 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="dd/dba/namespacedivide__and__conquer.html" target="_self">divide_and_conquer</a></td><td class="desc">For std::vector </td></tr>
<tr id="row_24_" 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="dd/dba/namespacedivide__and__conquer.html" target="_self">divide_and_conquer</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_25_" class="odd"><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/d75/namespacednf__sort.html" target="_self">dnf_sort</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Dutch_national_flag_problem" target="_blank">DNF sort</a> implementation </td></tr>
<tr id="row_26_" 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" target="_blank">double hashing</a> algorithm </td></tr>
<tr id="row_27_" class="odd"><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/d88/namespacedp.html" target="_self">dp</a></td><td class="desc">For std::vector </td></tr>