Documentation for af6e2c8991

2026-11-04 14:54:35 +08:00 · 2026-09-21 04:13:18 +00:00
parent fa852a6801
commit cc04e74d11
2789 changed files with 66741 additions and 46802 deletions
--- a/dd/d89/insertionsortrecursive_8cpp.html
+++ b/dd/d89/insertionsortrecursive_8cpp.html
@@ -4,7 +4,7 @@
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
-<meta name="generator" content="Doxygen 1.14.0"/>
+<meta name="generator" content="Doxygen 1.18.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>TheAlgorithms/C++: sorting/insertion_sort_recursive.cpp File Reference</title>
 <link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -59,22 +59,47 @@ window.MathJax = {
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.14.0 -->
+<!-- Generated by Doxygen 1.18.0 -->
 <script type="text/javascript">
-var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+let searchBox = new SearchBox("searchBox", "../../search/",'.html');
 </script>
 <script type="text/javascript">
-$(function() { codefold.init(); });
+document.addEventListener('DOMContentLoaded', codefold.init);
+</script>
+<script type="application/json" id="doxygen-config">
+{
+  "relPath": "../../",
+  "generateTreeView": true,
+  "searchEngine": true,
+  "serverBasedSearch": false,
+  "disableIndex": false,
+  "dynamicMenus": true,
+  "fullSidebar": false
+}
 </script>
 <script type="text/javascript" src="../../menudata.js"></script>
 <script type="text/javascript" src="../../menu.js"></script>
-<script type="text/javascript">
-$(function() {
-  initMenu('../../',true,false,'search.php','Search',true);
-  $(function() { init_search(); });
-});
-</script>
-<div id="main-nav"></div>
+<div id="main-nav-mobile">
+<div class="sm sm-dox"><input id="main-menu-state" type="checkbox"/>
+<label class="main-menu-btn" for="main-menu-state">
+<span class="main-menu-btn-icon"></span> Toggle main menu visibility</label>
+<span id="searchBoxPos1"></span>
+</div>
+</div><!-- main-nav-mobile -->
+<div id="main-nav">
+  <ul class="sm sm-dox" id="main-menu">
+    <li id="searchBoxPos2">
+        <div id="MSearchBox" class="MSearchBoxInactive">
+        <span class="left">
+          <span id="MSearchSelect" class="search-icon"><span class="search-icon-dropdown"></span></span>
+          <input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"/>
+          </span><span class="right">
+            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><div id="MSearchCloseImg" class="close-icon"></div></a>
+          </span>
+        </div>
+    </li>
+  </ul>
+</div><!-- main-nav -->
 </div><!-- top -->
 <div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
@@ -82,20 +107,16 @@ $(function() {
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
-  <div id="splitbar" style="-moz-user-select:none;" 
-       class="ui-resizable-handle">
+  <div id="splitbar" class="ui-resizable-handle">
  </div>
 </div>
 <script type="text/javascript">
-$(function(){initNavTree('dd/d89/insertion__sort__recursive_8cpp.html','../../',''); });
+document.addEventListener('DOMContentLoaded',() => { initNavTree('dd/d89/insertion__sort__recursive_8cpp.html','../../',''); });
 </script>
 <div id="container">
 <div id="doc-content">
 <!-- window showing the filter options -->
-<div id="MSearchSelectWindow"
-     onmouseover="return searchBox.OnSearchSelectShow()"
-     onmouseout="return searchBox.OnSearchSelectHide()"
-     onkeydown="return searchBox.OnSearchSelectKey(event)">
+<div id="MSearchSelectWindow">
 </div>

 <!-- iframe showing the search results (closed by default) -->
@@ -133,23 +154,23 @@ Include dependency graph for insertion_sort_recursive.cpp:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
-<tr class="memitem:sorting" id="r_sorting"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
+<tr class="memitem:sorting" id="r_sorting"><td class="memItemLeft">namespace &#160;</td><td class="memItemRight"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
 <tr class="memdesc:d5/d91/namespacesorting"><td class="mdescLeft">&#160;</td><td class="mdescRight">for working with vectors <br /></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9" id="r_a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
-<tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9 template"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a> (T *arr, int n)</td></tr>
+<tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9 template"><td class="memItemLeft">void&#160;</td><td class="memItemRight"><a class="el" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a> (T *arr, int n)</td></tr>
 <tr class="memdesc:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort Function.  <br /></td></tr>
 <tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f" id="r_a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
-<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f template"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">sorting::insertionSort</a> (std::vector&lt; T &gt; *arr)</td></tr>
+<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f template"><td class="memItemLeft">void&#160;</td><td class="memItemRight"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">sorting::insertionSort</a> (std::vector&lt; T &gt; *arr)</td></tr>
 <tr class="memdesc:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort for a vector.  <br /></td></tr>
 <tr class="memitem:a59914553f24088342c139645a02a8a49" id="r_a59914553f24088342c139645a02a8a49"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
-<tr class="memitem:a59914553f24088342c139645a02a8a49 template"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59914553f24088342c139645a02a8a49">create_random_array</a> (T *arr, int N)</td></tr>
+<tr class="memitem:a59914553f24088342c139645a02a8a49 template"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a59914553f24088342c139645a02a8a49">create_random_array</a> (T *arr, int N)</td></tr>
 <tr class="memdesc:a59914553f24088342c139645a02a8a49"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper function to create a random array.  <br /></td></tr>
-<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
+<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
 <tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">self test implementation  <br /></td></tr>
-<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
+<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft">int&#160;</td><td class="memItemRight"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
 </table>
 <a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
@@ -248,10 +269,10 @@ template&lt;typename T&gt; </div>

 <p class="definition">Definition at line <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html">insertion_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  149</span>           {</div>
-<div class="line"><span class="lineno">  150</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); </div>
+<div class="line"><span class="lineno">  150</span>    <a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a>(); </div>
 <div class="line"><span class="lineno">  151</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  152</span>}</div>
-<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00105">insertion_sort_recursive.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -309,19 +330,19 @@ template&lt;typename T&gt; </div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordtype">int</span> arr5[50];</div>
 <div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_function" href="#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr5, 50);</div>
+<div class="line"><span class="lineno">  132</span>    <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr5, 50);</div>
 <div class="line"><span class="lineno">  133</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr5, 50);</div>
 <div class="line"><span class="lineno">  134</span>    assert(std::is_sorted(arr5, arr5 + 50));</div>
 <div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  136</span> </div>
 <div class="line"><span class="lineno">  137</span>    <span class="keywordtype">float</span> arr6[50];</div>
 <div class="line"><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_function" href="#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr6, 50);</div>
+<div class="line"><span class="lineno">  139</span>    <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr6, 50);</div>
 <div class="line"><span class="lineno">  140</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr6, 50);</div>
 <div class="line"><span class="lineno">  141</span>    assert(std::is_sorted(arr6, arr6 + 50));</div>
 <div class="line"><span class="lineno">  142</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  143</span>}</div>
-<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Helper function to create a random array.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00094">insertion_sort_recursive.cpp:94</a></div></div>
+<div class="ttc" id="ainsertion__sort_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Create a random array objecthelper function to create a random array.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00101">insertion_sort.cpp:101</a></div></div>
 <div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00059">insertion_sort.cpp:59</a></div></div>
 </div><!-- fragment -->
 </div>
@@ -339,8 +360,8 @@ template&lt;typename T&gt; </div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
-    <li class="navelem"><a href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a href="../../dd/d89/insertion__sort__recursive_8cpp.html">insertion_sort_recursive.cpp</a></li>
-    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
+    <li class="navelem"><b>sorting</b></li><li class="navelem"><a href="../../dd/d89/insertion__sort__recursive_8cpp.html">insertion_sort_recursive.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.18.0 </li>
  </ul>
 </div>
 </body>