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

Documentation for 8b1eab204b

Browse Source
This commit is contained in:
realstealthninja
2024-11-04 12:43:05 +00:00
parent 4fb6e622e9
commit a7bccf7d01
6732 changed files with 153919 additions and 365711 deletions
Download Patch File Download Diff File Expand all files Collapse all files

153
de/d7b/merge__insertion__sort_8cpp.html
View File

@@ -1,3 +1,4 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
@@ -5,10 +6,15 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/merge_insertion_sort.cpp File Reference</title>
<title>TheAlgorithms/C++: sorting/merge_insertion_sort.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
@@ -124,7 +141,9 @@ Include dependency graph for merge_insertion_sort.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d1f/merge__insertion__sort_8cpp__incl.svg" width="514" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
</div>
<p><a href="../../de/d7b/merge__insertion__sort_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><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>
@@ -137,15 +156,15 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1" id="r_a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *A, size_t start, size_t end)</td></tr>
<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a> (std::array&lt; T, N &gt; *A, size_t start, size_t end)</td></tr>
<tr class="memdesc:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion merge algorithm. <br /></td></tr>
<tr class="separator:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf" id="r_af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4de4067a9a866ffd985c5b5055ccedf">sorting::merge_insertion::merge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *array, size_t min, size_t max, size_t mid)</td></tr>
<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4de4067a9a866ffd985c5b5055ccedf">sorting::merge_insertion::merge</a> (std::array&lt; T, N &gt; *array, size_t min, size_t max, size_t mid)</td></tr>
<tr class="memdesc:af4de4067a9a866ffd985c5b5055ccedf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Perform merge of data in a window. <br /></td></tr>
<tr class="separator:af4de4067a9a866ffd985c5b5055ccedf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7161278f18e83b671c6454b139cc5674" id="r_a7161278f18e83b671c6454b139cc5674"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:a7161278f18e83b671c6454b139cc5674"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7161278f18e83b671c6454b139cc5674">sorting::merge_insertion::mergeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *array, size_t min, size_t max, size_t threshold)</td></tr>
<tr class="memitem:a7161278f18e83b671c6454b139cc5674"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7161278f18e83b671c6454b139cc5674">sorting::merge_insertion::mergeSort</a> (std::array&lt; T, N &gt; *array, size_t min, size_t max, size_t threshold)</td></tr>
<tr class="memdesc:a7161278f18e83b671c6454b139cc5674"><td class="mdescLeft">&#160;</td><td class="mdescRight">Final combined algorithm. Algorithm utilizes <a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1" title="Insertion merge algorithm.">sorting::merge_insertion::InsertionSort</a> if window length is less than threshold, else performs merge sort recursively using <a class="el" href="#a7161278f18e83b671c6454b139cc5674" title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length...">sorting::merge_insertion::mergeSort</a>. <br /></td></tr>
<tr class="separator:a7161278f18e83b671c6454b139cc5674"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -161,6 +180,8 @@ Functions</h2></td></tr>
<dd>
<a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd>Individual algorithms: <a class="el" href="../../dd/d0d/insertion__sort_8cpp.html" title="Insertion Sort Algorithm (Insertion Sort)">insertion_sort.cpp</a> and <a class="el" href="../../d5/df4/merge__sort_8cpp.html" title="Merege Sort Algorithm (MEREGE SORT) implementation">merge_sort.cpp</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a0cba4fbf287ab8cb978ed7f8fef886b1" name="a0cba4fbf287ab8cb978ed7f8fef886b1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">&#9670;&#160;</a></span>InsertionSort()</h2>
@@ -176,7 +197,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname">static void sorting::merge_insertion::InsertionSort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
<td class="paramtype">std::array&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -213,11 +234,13 @@ template&lt;typename T , size_t N&gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 37</span> {</div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordtype">size_t</span> i = 0, j = 0;</div>
<div class="line"><span class="lineno"> 39</span> T *ptr = A-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/data.html">data</a>();</div>
<div class="line"><span class="lineno"> 39</span> T *ptr = A-&gt;data();</div>
<div class="line"><span class="lineno"> 40</span> </div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (i = start; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>; i++) {</div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (i = start; i &lt; end; i++) {</div>
<div class="line"><span class="lineno"> 42</span> T temp = ptr[i];</div>
<div class="line"><span class="lineno"> 43</span> j = i;</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">while</span> (j &gt; start &amp;&amp; temp &lt; ptr[j - 1]) {</div>
@@ -231,14 +254,7 @@ template&lt;typename T , size_t N&gt; </div>
<div class="line"><span class="lineno"> 52</span> ptr[j] = temp;</div>
<div class="line"><span class="lineno"> 53</span> }</div>
<div class="line"><span class="lineno"> 54</span>}</div>
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/data.html">std::array::data</a></div><div class="ttdeci">T data(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg" width="328" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -258,20 +274,15 @@ Here is the call graph for this function:</div>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00159">159</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 159</span> {</div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 160</span> std::srand(std::time(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 161</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 163</span>}</div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition</b> merge_insertion_sort.cpp:132</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="336" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00132">merge_insertion_sort.cpp:132</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="af4de4067a9a866ffd985c5b5055ccedf" name="af4de4067a9a866ffd985c5b5055ccedf"></a>
@@ -288,7 +299,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname">static void sorting::merge_insertion::merge </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
<td class="paramtype">std::array&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -330,15 +341,17 @@ template&lt;typename T , size_t N&gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 67</span> {</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordtype">size_t</span> firstIndex = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>;</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordtype">size_t</span> firstIndex = min;</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordtype">size_t</span> secondIndex = mid + 1;</div>
<div class="line"><span class="lineno"> 70</span> </div>
<div class="line"><span class="lineno"> 71</span> <span class="keyword">auto</span> ptr = array-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/data.html">data</a>();</div>
<div class="line"><span class="lineno"> 72</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;T, N + 1&gt;</a> tempArray{0};</div>
<div class="line"><span class="lineno"> 71</span> <span class="keyword">auto</span> ptr = array-&gt;data();</div>
<div class="line"><span class="lineno"> 72</span> std::array&lt;T, N + 1&gt; tempArray{0};</div>
<div class="line"><span class="lineno"> 73</span> </div>
<div class="line"><span class="lineno"> 74</span> <span class="comment">// While there are elements in the left or right runs</span></div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> index = min; index &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a>; index++) {</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> index = min; index &lt;= max; index++) {</div>
<div class="line"><span class="lineno"> 76</span> <span class="comment">// If left run head exists and is &lt;= existing right run head.</span></div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">if</span> (firstIndex &lt;= mid &amp;&amp;</div>
<div class="line"><span class="lineno"> 78</span> (secondIndex &gt; max || ptr[firstIndex] &lt;= ptr[secondIndex])) {</div>
@@ -351,20 +364,11 @@ template&lt;typename T , size_t N&gt; </div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="line"><span class="lineno"> 86</span> </div>
<div class="line"><span class="lineno"> 87</span> <span class="comment">// transfer to the initial array</span></div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memcpy.html">memcpy</a>(ptr + min, tempArray.data() + min, (max - min) * <span class="keyword">sizeof</span>(T));</div>
<div class="line"><span class="lineno"> 88</span> memcpy(ptr + min, tempArray.data() + min, (max - min) * <span class="keyword">sizeof</span>(T));</div>
<div class="line"><span class="lineno"> 89</span> <span class="comment">// for (int index = min; index &lt;= max; index++) ptr[index] =</span></div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// tempArray[index];</span></div>
<div class="line"><span class="lineno"> 91</span>}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
<div class="ttc" id="amemcpy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memcpy.html">std::memcpy</a></div><div class="ttdeci">T memcpy(T... args)</div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg" width="328" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
<a id="a7161278f18e83b671c6454b139cc5674" name="a7161278f18e83b671c6454b139cc5674"></a>
@@ -378,7 +382,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname">void sorting::merge_insertion::mergeSort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
<td class="paramtype">std::array&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -415,13 +419,15 @@ template&lt;typename T , size_t N&gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 108</span> {</div>
<div class="line"><span class="lineno"> 109</span> <span class="comment">// prerequisite</span></div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">if</span> ((max - min) &lt;= threshold) {</div>
<div class="line"><span class="lineno"> 111</span> <a class="code hl_function" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">InsertionSort</a>(array, min, max);</div>
<div class="line"><span class="lineno"> 112</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 113</span> <span class="comment">// get the middle point</span></div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordtype">size_t</span> mid = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>) &gt;&gt; 1;</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordtype">size_t</span> mid = (max + min) &gt;&gt; 1;</div>
<div class="line"><span class="lineno"> 115</span> </div>
<div class="line"><span class="lineno"> 116</span> <span class="comment">// apply merge sort to both parts of this</span></div>
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(array, min, mid, threshold);</div>
@@ -431,15 +437,10 @@ template&lt;typename T , size_t N&gt; </div>
<div class="line"><span class="lineno"> 121</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a>(array, min, max, mid);</div>
<div class="line"><span class="lineno"> 122</span> }</div>
<div class="line"><span class="lineno"> 123</span>}</div>
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:71</div></div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition</b> merge_insertion_sort.cpp:37</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg" width="538" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00033">merge_sort.cpp:33</a></div></div>
<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00071">merge_sort.cpp:71</a></div></div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00037">merge_insertion_sort.cpp:37</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -467,39 +468,31 @@ Here is the call graph for this function:</div>
<p>Function to test code using random arrays. </p>
<dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 132</span> {</div>
<div class="line"><span class="lineno"> 133</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> size = 30;</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a> array{0};</div>
<div class="line"><span class="lineno"> 134</span> std::array&lt;int, size&gt; array{0};</div>
<div class="line"><span class="lineno"> 135</span> <span class="comment">// input</span></div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
<div class="line"><span class="lineno"> 137</span> array[i] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100 - 50;</div>
<div class="line"><span class="lineno"> 138</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 137</span> array[i] = std::rand() % 100 - 50;</div>
<div class="line"><span class="lineno"> 138</span> std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 139</span> }</div>
<div class="line"><span class="lineno"> 140</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 140</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 141</span> </div>
<div class="line"><span class="lineno"> 142</span> <a class="code hl_function" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a>(&amp;array, 0, size);</div>
<div class="line"><span class="lineno"> 143</span> <span class="comment">// sorting::merge_insertion::mergeSort(&amp;array, 0, size, 10);</span></div>
<div class="line"><span class="lineno"> 144</span> </div>
<div class="line"><span class="lineno"> 145</span> <span class="comment">// output</span></div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><span class="lineno"> 147</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 147</span> std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 148</span> }</div>
<div class="line"><span class="lineno"> 149</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 149</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 150</span> </div>
<div class="line"><span class="lineno"> 151</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array)));</div>
<div class="line"><span class="lineno"> 152</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 151</span> assert(std::is_sorted(std::begin(array), std::end(array)));</div>
<div class="line"><span class="lineno"> 152</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 153</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="203" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->

6
de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.map
View File

@@ -1,6 +0,0 @@
<map id="sorting::merge_insertion::InsertionSort" name="sorting::merge_insertion::InsertionSort">
<area shape="rect" id="Node000001" title="Insertion merge algorithm." alt="" coords="5,29,166,70"/>
<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="50,29,49,19,54,10,67,5,86,3,106,5,117,11,115,16,104,10,85,8,68,10,58,14,54,20,56,28"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="214,37,323,62"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,47,198,47,198,52,166,52"/>
</map>

1
de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.md5
View File

@@ -1 +0,0 @@
9bbb42743a0d26aebc2dc958a33ebe51

75
de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg
View File

@@ -1,75 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: sorting::merge_insertion::InsertionSort Pages: 1 -->
<svg width="246pt" height="57pt"
viewBox="0.00 0.00 246.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>sorting::merge_insertion::InsertionSort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Insertion merge algorithm.">
<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge2_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M35.83,-30.99C30.87,-40.06 38.97,-48.5 60.12,-48.5 71.7,-48.5 79.36,-45.97 83.12,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.57,-42.83 84.25,-32.49 79.62,-42.02 86.57,-42.83"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.0 KiB

49
de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph_org.svg
View File

@@ -1,49 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: sorting::merge_insertion::InsertionSort Pages: 1 -->
<svg width="246pt" height="57pt"
viewBox="0.00 0.00 246.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>sorting::merge_insertion::InsertionSort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Insertion merge algorithm.">
<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge2_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M35.83,-30.99C30.87,-40.06 38.97,-48.5 60.12,-48.5 71.7,-48.5 79.36,-45.97 83.12,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.57,-42.83 84.25,-32.49 79.62,-42.02 86.57,-42.83"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.3 KiB

8
de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.map
View File

@@ -1,8 +0,0 @@
<map id="sorting::merge_insertion::mergeSort" name="sorting::merge_insertion::mergeSort">
<area shape="rect" id="Node000001" title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length..." alt="" coords="5,29,166,70"/>
<area shape="rect" id="Node000002" href="$de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1" title="Insertion merge algorithm." alt="" coords="214,29,374,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,47,198,47,198,52,166,52"/>
<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="259,29,257,19,263,10,275,5,294,3,314,5,326,11,323,16,312,10,294,8,277,10,266,14,262,20,264,28"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="422,37,531,62"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="374,47,407,47,407,52,374,52"/>
</map>

1
de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.md5
View File

@@ -1 +0,0 @@
e2c5a0b9b470386105ff64832be5a363

94
de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg
View File

@@ -1,94 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: sorting::merge_insertion::mergeSort Pages: 1 -->
<svg width="403pt" height="57pt"
viewBox="0.00 0.00 402.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>sorting::merge_insertion::mergeSort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length...">
<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1" target="_top" xlink:title="Insertion merge algorithm.">
<polygon fill="white" stroke="#666666" points="276.5,-30.5 156.25,-30.5 156.25,0 276.5,0 276.5,-30.5"/>
<text text-anchor="start" x="164.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.32,-15.25C128.23,-15.25 136.41,-15.25 144.5,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.31,-18.75 154.31,-15.25 144.31,-11.75 144.31,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge3_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M192.08,-30.99C187.12,-40.06 195.22,-48.5 216.38,-48.5 227.95,-48.5 235.61,-45.97 239.37,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.82,-42.83 240.5,-32.49 235.87,-42.02 242.82,-42.83"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="394.5,-24.88 312.5,-24.88 312.5,-5.63 394.5,-5.63 394.5,-24.88"/>
<text text-anchor="middle" x="353.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M276.64,-15.25C284.74,-15.25 293,-15.25 300.95,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="300.8,-18.75 310.8,-15.25 300.8,-11.75 300.8,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 4.1 KiB

68
de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph_org.svg
View File

@@ -1,68 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: sorting::merge_insertion::mergeSort Pages: 1 -->
<svg width="403pt" height="57pt"
viewBox="0.00 0.00 402.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>sorting::merge_insertion::mergeSort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length...">
<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1" target="_top" xlink:title="Insertion merge algorithm.">
<polygon fill="white" stroke="#666666" points="276.5,-30.5 156.25,-30.5 156.25,0 276.5,0 276.5,-30.5"/>
<text text-anchor="start" x="164.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.32,-15.25C128.23,-15.25 136.41,-15.25 144.5,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.31,-18.75 154.31,-15.25 144.31,-11.75 144.31,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge3_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M192.08,-30.99C187.12,-40.06 195.22,-48.5 216.38,-48.5 227.95,-48.5 235.61,-45.97 239.37,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.82,-42.83 240.5,-32.49 235.87,-42.02 242.82,-42.83"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="394.5,-24.88 312.5,-24.88 312.5,-5.63 394.5,-5.63 394.5,-24.88"/>
<text text-anchor="middle" x="353.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M276.64,-15.25C284.74,-15.25 293,-15.25 300.95,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="300.8,-18.75 310.8,-15.25 300.8,-11.75 300.8,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.3 KiB

13
de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,13 +0,0 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Function to test code using random arrays." alt="" coords="5,104,49,130"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="108,5,186,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,102,61,72,95,40,100,37,103,41,98,44,65,76,40,106"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="113,55,181,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,106,99,84,101,89,50,110"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="111,104,182,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,96,114,96,120,49,120"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="97,153,197,179"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,123,101,144,99,149,48,128"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="111,203,183,228"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="40,128,65,158,98,189,103,193,100,197,95,194,61,162,36,132"/>
</map>

1
de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +0,0 @@
83ede3b05768cb2f6aabe18451830818

137
de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,137 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test Pages: 1 -->
<svg width="152pt" height="175pt"
viewBox="0.00 0.00 151.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to test code using random arrays.">
<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="135.5,-167.25 76.75,-167.25 76.75,-148 135.5,-148 135.5,-167.25"/>
<text text-anchor="middle" x="106.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M24.32,-93.36C33.46,-105.42 50.36,-126.03 68.5,-139.62 69.62,-140.46 70.78,-141.28 71.97,-142.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.8,-144.85 80.2,-146.87 73.33,-138.81 69.8,-144.85"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="131.75,-130.25 80.5,-130.25 80.5,-111 131.75,-111 131.75,-130.25"/>
<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.96,-90.24C43.45,-94.66 57.66,-100.64 70.7,-106.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.3,-109.34 79.88,-109.99 72.02,-102.89 69.3,-109.34"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="132.88,-93.25 79.38,-93.25 79.38,-74 132.88,-74 132.88,-93.25"/>
<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.96,-83.62C42.69,-83.62 55.61,-83.62 67.84,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="67.7,-87.13 77.7,-83.63 67.7,-80.13 67.7,-87.13"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="143.75,-56.25 68.5,-56.25 68.5,-37 143.75,-37 143.75,-56.25"/>
<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.96,-77.01C43.45,-72.59 57.66,-66.61 70.7,-61.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.02,-64.36 79.88,-57.26 69.3,-57.91 72.02,-64.36"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="133.25,-19.25 79,-19.25 79,0 133.25,0 133.25,-19.25"/>
<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M24.32,-73.89C33.46,-61.83 50.36,-41.22 68.5,-27.62 69.62,-26.79 70.78,-25.97 71.97,-25.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.33,-28.44 80.2,-20.38 69.8,-22.4 73.33,-28.44"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 5.7 KiB

111
de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -1,111 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test Pages: 1 -->
<svg width="152pt" height="175pt"
viewBox="0.00 0.00 151.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to test code using random arrays.">
<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="135.5,-167.25 76.75,-167.25 76.75,-148 135.5,-148 135.5,-167.25"/>
<text text-anchor="middle" x="106.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M24.32,-93.36C33.46,-105.42 50.36,-126.03 68.5,-139.62 69.62,-140.46 70.78,-141.28 71.97,-142.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.8,-144.85 80.2,-146.87 73.33,-138.81 69.8,-144.85"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="131.75,-130.25 80.5,-130.25 80.5,-111 131.75,-111 131.75,-130.25"/>
<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.96,-90.24C43.45,-94.66 57.66,-100.64 70.7,-106.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.3,-109.34 79.88,-109.99 72.02,-102.89 69.3,-109.34"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="132.88,-93.25 79.38,-93.25 79.38,-74 132.88,-74 132.88,-93.25"/>
<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.96,-83.62C42.69,-83.62 55.61,-83.62 67.84,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="67.7,-87.13 77.7,-83.63 67.7,-80.13 67.7,-87.13"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="143.75,-56.25 68.5,-56.25 68.5,-37 143.75,-37 143.75,-56.25"/>
<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.96,-77.01C43.45,-72.59 57.66,-66.61 70.7,-61.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.02,-64.36 79.88,-57.26 69.3,-57.91 72.02,-64.36"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="133.25,-19.25 79,-19.25 79,0 133.25,0 133.25,-19.25"/>
<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M24.32,-73.89C33.46,-61.83 50.36,-41.22 68.5,-27.62 69.62,-26.79 70.78,-25.97 71.97,-25.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.33,-28.44 80.2,-20.38 69.8,-22.4 73.33,-28.44"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 5.0 KiB

19
de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,19 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,55,182,80"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,104,96,85,99,90,56,109"/>
<area shape="rect" id="Node000003" href="$de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test code using random arrays." alt="" coords="121,104,164,130"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,114,105,114,105,120,55,120"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,153,178,179"/>
<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="56,125,99,144,96,149,54,130"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="241,5,319,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="163,103,180,91,204,65,228,40,233,37,236,41,232,44,208,69,184,95,166,107"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="246,55,314,80"/>
<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="163,107,231,82,233,87,165,112"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="244,104,316,130"/>
<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="164,114,229,114,229,120,164,120"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="230,153,330,179"/>
<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="165,122,229,145,227,150,163,127"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="244,203,316,228"/>
<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="166,126,184,139,208,165,232,189,236,193,233,197,228,194,204,168,180,143,163,131"/>
</map>

1
de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
964eefbdfced9d17d5a44ce2c9c160a2

191
de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,191 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="252pt" height="175pt"
viewBox="0.00 0.00 251.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-91.65C46.63,-95.83 58.28,-101.07 69.1,-105.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-109.1 78.15,-110.01 70.47,-102.72 67.6,-109.1"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test code using random arrays.">
<polygon fill="white" stroke="#666666" points="119,-93.25 86.5,-93.25 86.5,-74 119,-74 119,-93.25"/>
<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-83.62C48.26,-83.62 62.44,-83.62 74.71,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="74.64,-87.13 84.64,-83.63 74.64,-80.13 74.64,-87.13"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.88,-56.25 75.62,-56.25 75.62,-37 129.88,-37 129.88,-56.25"/>
<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node9 -->
<g id="edge8_Node000001_Node000009" class="edge">
<title>Node1&#45;&gt;Node9</title>
<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-75.6C46.63,-71.42 58.28,-66.18 69.1,-61.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="70.47,-64.53 78.15,-57.24 67.6,-58.15 70.47,-64.53"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="235.5,-167.25 176.75,-167.25 176.75,-148 235.5,-148 235.5,-167.25"/>
<text text-anchor="middle" x="206.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.46,-92.47C123.84,-95.19 128.49,-98.34 132.5,-101.62 150.5,-116.36 149.77,-125.83 168.5,-139.62 169.62,-140.45 170.79,-141.26 171.99,-142.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.83,-144.83 180.23,-146.82 173.34,-138.78 169.83,-144.83"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="231.75,-130.25 180.5,-130.25 180.5,-111 231.75,-111 231.75,-130.25"/>
<text text-anchor="middle" x="206.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.15,-89.24C132.54,-94.13 152.46,-101.4 169.76,-107.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.09,-110.83 178.68,-110.97 170.49,-104.26 168.09,-110.83"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="232.88,-93.25 179.38,-93.25 179.38,-74 232.88,-74 232.88,-93.25"/>
<text text-anchor="middle" x="206.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge5_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.15,-83.62C132.02,-83.62 150.92,-83.62 167.72,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.4,-87.13 177.4,-83.63 167.4,-80.13 167.4,-87.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="243.75,-56.25 168.5,-56.25 168.5,-37 243.75,-37 243.75,-56.25"/>
<text text-anchor="middle" x="206.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge6_Node000003_Node000007" class="edge">
<title>Node3&#45;&gt;Node7</title>
<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.15,-78.01C131.87,-73.36 150.48,-66.57 167.14,-60.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.1,-63.86 176.29,-57.15 165.7,-57.29 168.1,-63.86"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node8 -->
<g id="edge7_Node000003_Node000008" class="edge">
<title>Node3&#45;&gt;Node8</title>
<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.46,-74.78C123.84,-72.06 128.49,-68.91 132.5,-65.62 150.5,-50.89 149.77,-41.42 168.5,-27.62 169.62,-26.8 170.79,-25.99 171.99,-25.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="173.34,-28.47 180.23,-20.43 169.83,-22.42 173.34,-28.47"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 8.3 KiB

165
de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,165 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="252pt" height="175pt"
viewBox="0.00 0.00 251.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-91.65C46.63,-95.83 58.28,-101.07 69.1,-105.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-109.1 78.15,-110.01 70.47,-102.72 67.6,-109.1"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test code using random arrays.">
<polygon fill="white" stroke="#666666" points="119,-93.25 86.5,-93.25 86.5,-74 119,-74 119,-93.25"/>
<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-83.62C48.26,-83.62 62.44,-83.62 74.71,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="74.64,-87.13 84.64,-83.63 74.64,-80.13 74.64,-87.13"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.88,-56.25 75.62,-56.25 75.62,-37 129.88,-37 129.88,-56.25"/>
<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node9 -->
<g id="edge8_Node000001_Node000009" class="edge">
<title>Node1&#45;&gt;Node9</title>
<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-75.6C46.63,-71.42 58.28,-66.18 69.1,-61.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="70.47,-64.53 78.15,-57.24 67.6,-58.15 70.47,-64.53"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="235.5,-167.25 176.75,-167.25 176.75,-148 235.5,-148 235.5,-167.25"/>
<text text-anchor="middle" x="206.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.46,-92.47C123.84,-95.19 128.49,-98.34 132.5,-101.62 150.5,-116.36 149.77,-125.83 168.5,-139.62 169.62,-140.45 170.79,-141.26 171.99,-142.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.83,-144.83 180.23,-146.82 173.34,-138.78 169.83,-144.83"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="231.75,-130.25 180.5,-130.25 180.5,-111 231.75,-111 231.75,-130.25"/>
<text text-anchor="middle" x="206.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.15,-89.24C132.54,-94.13 152.46,-101.4 169.76,-107.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.09,-110.83 178.68,-110.97 170.49,-104.26 168.09,-110.83"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="232.88,-93.25 179.38,-93.25 179.38,-74 232.88,-74 232.88,-93.25"/>
<text text-anchor="middle" x="206.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge5_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.15,-83.62C132.02,-83.62 150.92,-83.62 167.72,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.4,-87.13 177.4,-83.63 167.4,-80.13 167.4,-87.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="243.75,-56.25 168.5,-56.25 168.5,-37 243.75,-37 243.75,-56.25"/>
<text text-anchor="middle" x="206.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge6_Node000003_Node000007" class="edge">
<title>Node3&#45;&gt;Node7</title>
<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.15,-78.01C131.87,-73.36 150.48,-66.57 167.14,-60.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.1,-63.86 176.29,-57.15 165.7,-57.29 168.1,-63.86"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node8 -->
<g id="edge7_Node000003_Node000008" class="edge">
<title>Node3&#45;&gt;Node8</title>
<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.46,-74.78C123.84,-72.06 128.49,-68.91 132.5,-65.62 150.5,-50.89 149.77,-41.42 168.5,-27.62 169.62,-26.8 170.79,-25.99 171.99,-25.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="173.34,-28.47 180.23,-20.43 169.83,-22.42 173.34,-28.47"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.5 KiB

5
de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="sorting::merge_insertion::merge" name="sorting::merge_insertion::merge">
<area shape="rect" id="Node000001" title="Perform merge of data in a window." alt="" coords="5,5,166,46"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="214,13,323,38"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,23,198,23,198,28,166,28"/>
</map>

1
de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.md5
View File

@@ -1 +0,0 @@
a33eee7458ce96d7113efc4984eb8bf5

66
de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg
View File

@@ -1,66 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: sorting::merge_insertion::merge Pages: 1 -->
<svg width="246pt" height="39pt"
viewBox="0.00 0.00 246.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>sorting::merge_insertion::merge</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Perform merge of data in a window.">
<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::merge</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.6 KiB

40
de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph_org.svg
View File

@@ -1,40 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: sorting::merge_insertion::merge Pages: 1 -->
<svg width="246pt" height="39pt"
viewBox="0.00 0.00 246.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>sorting::merge_insertion::merge</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Perform merge of data in a window.">
<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::merge</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.9 KiB

260
de/d7b/merge__insertion__sort_8cpp_source.html Normal file
View File

@@ -0,0 +1,260 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: sorting/merge_insertion_sort.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('de/d7b/merge__insertion__sort_8cpp_source.html','../../'); initResizable(true); });
/* @license-end */
</script>
<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>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">merge_insertion_sort.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../de/d7b/merge__insertion__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="preprocessor">#include &lt;array&gt;</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a> {</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1"> 37</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">InsertionSort</a>(std::array&lt;T, N&gt; *A, <span class="keywordtype">size_t</span> start, <span class="keywordtype">size_t</span> end) {</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordtype">size_t</span> i = 0, j = 0;</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> T *ptr = A-&gt;data();</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> </div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">for</span> (i = start; i &lt; end; i++) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> T temp = ptr[i];</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> j = i;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">while</span> (j &gt; start &amp;&amp; temp &lt; ptr[j - 1]) {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> ptr[j] = ptr[j - 1];</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> j--;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> }</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// for (j = i; j &gt; start &amp;&amp; temp &lt; ptr[j - 1]; --j) {</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// ptr[j] = ptr[j - 1];</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// }</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> ptr[j] = temp;</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> }</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span>}</div>
</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf"> 67</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> merge(std::array&lt;T, N&gt; *array, <span class="keywordtype">size_t</span> min, <span class="keywordtype">size_t</span> max, <span class="keywordtype">size_t</span> mid) {</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordtype">size_t</span> firstIndex = min;</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordtype">size_t</span> secondIndex = mid + 1;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">auto</span> ptr = array-&gt;data();</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> std::array&lt;T, N + 1&gt; tempArray{0};</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// While there are elements in the left or right runs</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> index = min; index &lt;= max; index++) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// If left run head exists and is &lt;= existing right run head.</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">if</span> (firstIndex &lt;= mid &amp;&amp;</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> (secondIndex &gt; max || ptr[firstIndex] &lt;= ptr[secondIndex])) {</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> tempArray[index] = ptr[firstIndex];</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> firstIndex++;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> tempArray[index] = ptr[secondIndex];</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> secondIndex++;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// transfer to the initial array</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> memcpy(ptr + min, tempArray.data() + min, (max - min) * <span class="keyword">sizeof</span>(T));</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// for (int index = min; index &lt;= max; index++) ptr[index] =</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// tempArray[index];</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span>}</div>
</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674"> 107</a></span><span class="keywordtype">void</span> mergeSort(std::array&lt;T, N&gt; *array, <span class="keywordtype">size_t</span> min, <span class="keywordtype">size_t</span> max,</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordtype">size_t</span> threshold) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// prerequisite</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keywordflow">if</span> ((max - min) &lt;= threshold) {</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">InsertionSort</a>(array, min, max);</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// get the middle point</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordtype">size_t</span> mid = (max + min) &gt;&gt; 1;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// apply merge sort to both parts of this</span></div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> mergeSort(array, min, mid, threshold);</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> mergeSort(array, mid, max, threshold);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// and finally merge all that sorted stuff</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> merge(array, min, max, mid);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> }</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span>}</div>
</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span>} <span class="comment">// namespace merge_insertion</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span>} <span class="comment">// namespace sorting</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 132</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> size = 30;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> std::array&lt;int, size&gt; array{0};</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// input</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> array[i] = std::rand() % 100 - 50;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> sorting::merge_insertion::InsertionSort(&amp;array, 0, size);</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// sorting::merge_insertion::mergeSort(&amp;array, 0, size, 10);</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> </div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// output</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> }</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> assert(std::is_sorted(std::begin(array), std::end(array)));</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test passed\n&quot;</span>;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span>}</div>
</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> </div>
<div class="foldopen" id="foldopen00159" data-start="{" data-end="}">
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 159</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> std::srand(std::time(<span class="keyword">nullptr</span>));</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span>}</div>
</div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">merge_insertion_sort.cpp:37</a></div></div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition</b> <a href="#l00132">merge_insertion_sort.cpp:132</a></div></div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00159">merge_insertion_sort.cpp:159</a></div></div>
<div class="ttc" id="anamespacemerge__insertion_html"><div class="ttname"><a href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a></div><div class="ttdoc">Combined Intersion-Merge sorting algorithm.</div></div>
<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../de/d7b/merge__insertion__sort_8cpp.html">merge_insertion_sort.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.12.0 </li>
</ul>
</div>
</body>
</html>