mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
499 lines
32 KiB
HTML
499 lines
32 KiB
HTML
<!-- 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.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<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>
|
|
<script type="text/javascript" src="../../navtree.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"> 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.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- 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">
|
|
$(function(){initNavTree('de/d7b/merge__insertion__sort_8cpp.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- 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 File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>Algorithm that combines insertion sort and merge sort. <a href="https://en.wikipedia.org/wiki/Merge-insertion_sort" target="_blank">Wiki link</a>
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <algorithm></code><br />
|
|
<code>#include <array></code><br />
|
|
<code>#include <cassert></code><br />
|
|
<code>#include <ctime></code><br />
|
|
<code>#include <iostream></code><br />
|
|
<code>#include <memory></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for merge_insertion_sort.cpp:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" loading="lazy" 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>
|
|
<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 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:sorting" id="r_sorting"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
|
|
<tr class="memdesc:d5/d91/namespacesorting"><td class="mdescLeft"> </td><td class="mdescRight">for working with vectors <br /></td></tr>
|
|
<tr class="memitem:merge_5Finsertion" id="r_merge_5Finsertion"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a></td></tr>
|
|
<tr class="memdesc:de/d0a/namespacemerge__insertion"><td class="mdescLeft"> </td><td class="mdescRight">Combined Intersion-Merge sorting algorithm. <br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1" id="r_a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplParams" colspan="2">template<typename T, size_t N> </td></tr>
|
|
<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1 template"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a> (std::array< T, N > *A, size_t start, size_t end)</td></tr>
|
|
<tr class="memdesc:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="mdescLeft"> </td><td class="mdescRight">Insertion merge algorithm. <br /></td></tr>
|
|
<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf" id="r_af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplParams" colspan="2">template<typename T, size_t N> </td></tr>
|
|
<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf template"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#af4de4067a9a866ffd985c5b5055ccedf">sorting::merge_insertion::merge</a> (std::array< T, N > *array, size_t min, size_t max, size_t mid)</td></tr>
|
|
<tr class="memdesc:af4de4067a9a866ffd985c5b5055ccedf"><td class="mdescLeft"> </td><td class="mdescRight">Perform merge of data in a window. <br /></td></tr>
|
|
<tr class="memitem:a7161278f18e83b671c6454b139cc5674" id="r_a7161278f18e83b671c6454b139cc5674"><td class="memTemplParams" colspan="2">template<typename T, size_t N> </td></tr>
|
|
<tr class="memitem:a7161278f18e83b671c6454b139cc5674 template"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a7161278f18e83b671c6454b139cc5674">sorting::merge_insertion::mergeSort</a> (std::array< T, N > *array, size_t min, size_t max, size_t threshold)</td></tr>
|
|
<tr class="memdesc:a7161278f18e83b671c6454b139cc5674"><td class="mdescLeft"> </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="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
|
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Function to test code using random arrays. <br /></td></tr>
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>Algorithm that combines insertion sort and merge sort. <a href="https://en.wikipedia.org/wiki/Merge-insertion_sort" target="_blank">Wiki link</a> </p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/sinkyoungdeok" target="_blank">@sinkyoungdeok</a> </dd>
|
|
<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="Merge Sort Algorithm (MERGE 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><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
|
<a id="a0cba4fbf287ab8cb978ed7f8fef886b1" name="a0cba4fbf287ab8cb978ed7f8fef886b1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">◆ </a></span>InsertionSort()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T, size_t N> </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void sorting::merge_insertion::InsertionSort </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::array< T, N > *</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>start</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>end</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Insertion merge algorithm. </p>
|
|
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../dd/d0d/insertion__sort_8cpp.html" title="Insertion Sort Algorithm (Insertion Sort)">insertion_sort.cpp</a></dd></dl>
|
|
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">T</td><td>array data type </td></tr>
|
|
<tr><td class="paramname">N</td><td>length of array </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">A</td><td>pointer to array to sort </td></tr>
|
|
<tr><td class="paramname">start</td><td>start index of sorting window </td></tr>
|
|
<tr><td class="paramname">end</td><td>end index of sorting window </td></tr>
|
|
</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->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 < 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 > start && temp < ptr[j - 1]) {</div>
|
|
<div class="line"><span class="lineno"> 45</span> ptr[j] = ptr[j - 1];</div>
|
|
<div class="line"><span class="lineno"> 46</span> j--;</div>
|
|
<div class="line"><span class="lineno"> 47</span> }</div>
|
|
<div class="line"><span class="lineno"> 48</span> <span class="comment">// for (j = i; j > start && temp < ptr[j - 1]; --j) {</span></div>
|
|
<div class="line"><span class="lineno"> 49</span> <span class="comment">// ptr[j] = ptr[j - 1];</span></div>
|
|
<div class="line"><span class="lineno"> 50</span> <span class="comment">// }</span></div>
|
|
<div class="line"><span class="lineno"> 51</span> </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><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int main </td>
|
|
<td>(</td>
|
|
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<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> 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> <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>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af4de4067a9a866ffd985c5b5055ccedf">◆ </a></span>merge()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T, size_t N> </div>
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void sorting::merge_insertion::merge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::array< T, N > *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>min</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>max</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>mid</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Perform merge of data in a window. </p>
|
|
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">T</td><td>array data type </td></tr>
|
|
<tr><td class="paramname">N</td><td>length of array </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">A</td><td>pointer to array to sort </td></tr>
|
|
<tr><td class="paramname">min</td><td>start index of window </td></tr>
|
|
<tr><td class="paramname">max</td><td>end index of window </td></tr>
|
|
<tr><td class="paramname">mid</td><td>mid-point of window </td></tr>
|
|
</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 = 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->data();</div>
|
|
<div class="line"><span class="lineno"> 72</span> std::array<T, N + 1> 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 <= max; index++) {</div>
|
|
<div class="line"><span class="lineno"> 76</span> <span class="comment">// If left run head exists and is <= existing right run head.</span></div>
|
|
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">if</span> (firstIndex <= mid &&</div>
|
|
<div class="line"><span class="lineno"> 78</span> (secondIndex > max || ptr[firstIndex] <= ptr[secondIndex])) {</div>
|
|
<div class="line"><span class="lineno"> 79</span> tempArray[index] = ptr[firstIndex];</div>
|
|
<div class="line"><span class="lineno"> 80</span> firstIndex++;</div>
|
|
<div class="line"><span class="lineno"> 81</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><span class="lineno"> 82</span> tempArray[index] = ptr[secondIndex];</div>
|
|
<div class="line"><span class="lineno"> 83</span> secondIndex++;</div>
|
|
<div class="line"><span class="lineno"> 84</span> }</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> 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 <= 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><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a7161278f18e83b671c6454b139cc5674" name="a7161278f18e83b671c6454b139cc5674"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a7161278f18e83b671c6454b139cc5674">◆ </a></span>mergeSort()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T, size_t N> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void sorting::merge_insertion::mergeSort </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::array< T, N > *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>min</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>max</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>threshold</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>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>. </p>
|
|
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">T</td><td>array data type </td></tr>
|
|
<tr><td class="paramname">N</td><td>length of array </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">A</td><td>pointer to array to sort </td></tr>
|
|
<tr><td class="paramname">min</td><td>start index of sort window </td></tr>
|
|
<tr><td class="paramname">max</td><td>end index of sort window </td></tr>
|
|
<tr><td class="paramname">threshold</td><td>window length threshold </td></tr>
|
|
</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) <= 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 = (max + min) >> 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>
|
|
<div class="line"><span class="lineno"> 118</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(array, mid, max, threshold);</div>
|
|
<div class="line"><span class="lineno"> 119</span> </div>
|
|
<div class="line"><span class="lineno"> 120</span> <span class="comment">// and finally merge all that sorted stuff</span></div>
|
|
<div class="line"><span class="lineno"> 121</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">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_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#l00082">merge_sort.cpp:82</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< T, N > *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 class="ttc" id="anamespacesorting_html_aa26de383227859210f14dcf12201a079"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">sorting::merge</a></div><div class="ttdeci">void merge(Iterator, Iterator, const Iterator, char[])</div><div class="ttdoc">merges 2 sorted adjacent segments into a larger sorted segment</div><div class="ttdef"><b>Definition</b> <a href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html#l00057">non_recursive_merge_sort.cpp:57</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void test </td>
|
|
<td>(</td>
|
|
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<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> std::array<int, size> 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 < size; i++) {</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 << array[i] << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><span class="lineno"> 139</span> }</div>
|
|
<div class="line"><span class="lineno"> 140</span> std::cout << 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>(&array, 0, size);</div>
|
|
<div class="line"><span class="lineno"> 143</span> <span class="comment">// sorting::merge_insertion::mergeSort(&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 < size; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 147</span> std::cout << array[i] << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><span class="lineno"> 148</span> }</div>
|
|
<div class="line"><span class="lineno"> 149</span> std::cout << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 150</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 << <span class="stringliteral">"Test passed\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 153</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a href="../../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.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|