backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 06:12:11 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for f1eddf4d65

Browse Source
This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions
Download Patch File Download Diff File Expand all files Collapse all files

70
de/d7b/merge__insertion__sort_8cpp.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<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" />
@@ -19,7 +19,6 @@
<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>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.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 */
$(function() { codefold.init(); });
</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 -->
@@ -94,10 +87,9 @@ $(function() {
</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.html','../../'); initResizable(true); });
/* @license-end */
$(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"
@@ -121,9 +113,6 @@ $(function(){initNavTree('de/d7b/merge__insertion__sort_8cpp.html','../../'); in
</div>
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">merge_insertion_sort.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -139,50 +128,43 @@ $(function(){initNavTree('de/d7b/merge__insertion__sort_8cpp.html','../../'); in
</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" 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 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 class="groupheader"><a id="namespaces" name="namespaces"></a>
<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:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
<tr class="memitem:sorting" id="r_sorting"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
<tr class="memdesc:d5/d91/namespacesorting"><td class="mdescLeft">&#160;</td><td class="mdescRight">for working with vectors <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a></td></tr>
<tr class="memitem:merge_5Finsertion" id="r_merge_5Finsertion"><td class="memItemLeft" align="right" valign="top">namespace &#160;</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">&#160;</td><td class="mdescRight">Combined Intersion-Merge sorting algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
<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&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> (std::array&lt; T, N &gt; *A, size_t start, size_t end)</td></tr>
<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1 template"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" 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> (std::array&lt; T, N &gt; *array, size_t min, size_t max, size_t mid)</td></tr>
<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf template"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" 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> (std::array&lt; T, N &gt; *array, size_t min, size_t max, size_t threshold)</td></tr>
<tr class="memitem:a7161278f18e83b671c6454b139cc5674 template"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" 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>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test code using random arrays. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<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="Merege Sort Algorithm (MEREGE SORT) implementation">merge_sort.cpp</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><h2 class="groupheader">Function Documentation</h2>
</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">&#9670;&#160;</a></span>InsertionSort()</h2>
@@ -195,7 +177,7 @@ template&lt;typename T, size_t N&gt; </div>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void sorting::merge_insertion::InsertionSort </td>
<td class="memname">void sorting::merge_insertion::InsertionSort </td>
<td>(</td>
<td class="paramtype">std::array&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
</tr>
@@ -297,7 +279,7 @@ template&lt;typename T, size_t N&gt; </div>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void sorting::merge_insertion::merge </td>
<td class="memname">void sorting::merge_insertion::merge </td>
<td>(</td>
<td class="paramtype">std::array&lt; T, N &gt; *</td> <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
</tr>
@@ -437,7 +419,7 @@ template&lt;typename T, size_t N&gt; </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#l00074">merge_sort.cpp:74</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#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&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 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 -->
@@ -453,7 +435,7 @@ template&lt;typename T, size_t N&gt; </div>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td class="memname">void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -497,11 +479,19 @@ template&lt;typename T, size_t N&gt; </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 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.13.2 </li>
<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>