backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity
Files
14583a2f33720eba2e2786d75e8e2312b85fa667
C-Plus-Plus/d4/d7a/shell__sort2_8cpp.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

548 lines
45 KiB
HTML
Raw Blame History

<!-- 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: sorting/shell_sort2.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="../../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.13.2 -->
<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('d4/d7a/shell__sort2_8cpp.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="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">shell_sort2.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cstdlib&gt;</code><br />
<code>#include &lt;ctime&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;utility&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for shell_sort2.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d86/shell__sort2_8cpp__incl.svg" width="488" height="111"><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="../../d4/d7a/shell__sort2_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>
<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>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a951127aea9d7e1e53ea9ae0868633246" id="r_a951127aea9d7e1e53ea9ae0868633246"><td class="memTemplParams" colspan="2">template&lt;class T&gt; </td></tr>
<tr class="memitem:a951127aea9d7e1e53ea9ae0868633246"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a> (T *arr, size_t LEN)</td></tr>
<tr class="separator:a951127aea9d7e1e53ea9ae0868633246"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a63aaff7cabfa3da2da8b9477b5fad9d6" id="r_a63aaff7cabfa3da2da8b9477b5fad9d6"><td class="memTemplParams" colspan="2">template&lt;typename T, size_t N&gt; </td></tr>
<tr class="memitem:a63aaff7cabfa3da2da8b9477b5fad9d6"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a63aaff7cabfa3da2da8b9477b5fad9d6">show_data</a> (T(&amp;arr)[N])</td></tr>
<tr class="separator:a63aaff7cabfa3da2da8b9477b5fad9d6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa" id="r_a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">sorting::shell_sort</a> (T *arr, size_t LEN)</td></tr>
<tr class="separator:a5669396c6a6b1e14b97589b6e37980aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4d76603c54d3dc56146e92d10a043924" id="r_a4d76603c54d3dc56146e92d10a043924"><td class="memTemplParams" colspan="2">template&lt;typename T, size_t N&gt; </td></tr>
<tr class="memitem:a4d76603c54d3dc56146e92d10a043924"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924">sorting::shell_sort</a> (T(&amp;arr)[N])</td></tr>
<tr class="separator:a4d76603c54d3dc56146e92d10a043924"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331" id="r_af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331">sorting::shell_sort</a> (std::vector&lt; T &gt; *arr)</td></tr>
<tr class="separator:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7eb77daed2cf1513f6d68c47a1c2db1c" id="r_a7eb77daed2cf1513f6d68c47a1c2db1c"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:a7eb77daed2cf1513f6d68c47a1c2db1c"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a> (const void *a, const void *b)</td></tr>
<tr class="separator:a7eb77daed2cf1513f6d68c47a1c2db1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a895b313cb2671e8f712040460325573e" id="r_a895b313cb2671e8f712040460325573e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a895b313cb2671e8f712040460325573e">test_int</a> (const int NUM_DATA)</td></tr>
<tr class="separator:a895b313cb2671e8f712040460325573e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a22ea0d1f7943ebb4371d31e44b465b6d" id="r_a22ea0d1f7943ebb4371d31e44b465b6d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a> (const int NUM_DATA)</td></tr>
<tr class="separator:a22ea0d1f7943ebb4371d31e44b465b6d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa" id="r_a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a> (T *arr, size_t LEN)</td></tr>
<tr class="separator:a5669396c6a6b1e14b97589b6e37980aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a7eb77daed2cf1513f6d68c47a1c2db1c" name="a7eb77daed2cf1513f6d68c47a1c2db1c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7eb77daed2cf1513f6d68c47a1c2db1c">&#9670;&#160;</a></span>compare()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="memname">
<tr>
<td class="memname">int compare </td>
<td>(</td>
<td class="paramtype">const void *</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const void *</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>function to compare sorting using cstdlib's qsort </p>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
<div class="line"><span class="lineno"> 88</span> T arg1 = *<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T *<span class="keyword">&gt;</span>(a);</div>
<div class="line"><span class="lineno"> 89</span> T arg2 = *<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T *<span class="keyword">&gt;</span>(b);</div>
<div class="line"><span class="lineno"> 90</span> </div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (arg1 &lt; arg2)</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">if</span> (arg1 &gt; arg2)</div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">return</span> 1;</div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 96</span> </div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">// return (arg1 &gt; arg2) - (arg1 &lt; arg2); // possible shortcut</span></div>
<div class="line"><span class="lineno"> 98</span> <span class="comment">// return arg1 - arg2; // erroneous shortcut (fails if INT_MIN is present)</span></div>
<div class="line"><span class="lineno"> 99</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</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">int</td> <td class="paramname"><span class="paramname"><em>argc</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char *</td> <td class="paramname"><span class="paramname"><em>argv</em></span>[]&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 183</span> {</div>
<div class="line"><span class="lineno"> 184</span> <span class="comment">// initialize random number generator - once per program</span></div>
<div class="line"><span class="lineno"> 185</span> std::srand(std::time(NULL));</div>
<div class="line"><span class="lineno"> 186</span> </div>
<div class="line"><span class="lineno"> 187</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(100); <span class="comment">// test with sorting random array of 100 values</span></div>
<div class="line"><span class="lineno"> 188</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 int values - passed. \n&quot;</span>;</div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(1000); <span class="comment">// test with sorting random array of 1000 values</span></div>
<div class="line"><span class="lineno"> 190</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 int values - passed.\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 191</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(10000); <span class="comment">// test with sorting random array of 10000 values</span></div>
<div class="line"><span class="lineno"> 192</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 int values - passed.\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 193</span> </div>
<div class="line"><span class="lineno"> 194</span> <a class="code hl_function" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(100); <span class="comment">// test with sorting random array of 100 values</span></div>
<div class="line"><span class="lineno"> 195</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 float values - passed. \n&quot;</span>;</div>
<div class="line"><span class="lineno"> 196</span> <a class="code hl_function" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(1000); <span class="comment">// test with sorting random array of 1000 values</span></div>
<div class="line"><span class="lineno"> 197</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 float values - passed.\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 198</span> <a class="code hl_function" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(10000); <span class="comment">// test with sorting random array of 10000 values</span></div>
<div class="line"><span class="lineno"> 199</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 float values - passed.\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 200</span> </div>
<div class="line"><span class="lineno"> 201</span> <span class="keywordtype">int</span> i, NUM_DATA;</div>
<div class="line"><span class="lineno"> 202</span> </div>
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">if</span> (argc == 2)</div>
<div class="line"><span class="lineno"> 204</span> NUM_DATA = atoi(argv[1]);</div>
<div class="line"><span class="lineno"> 205</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 206</span> NUM_DATA = 200;</div>
<div class="line"><span class="lineno"> 207</span> </div>
<div class="line"><span class="lineno"> 208</span> <span class="comment">// int array = new int[NUM_DATA];</span></div>
<div class="line"><span class="lineno"> 209</span> <span class="keywordtype">int</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
<div class="line"><span class="lineno"> 210</span> <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
<div class="line"><span class="lineno"> 211</span> <span class="keywordtype">int</span> range = 1800;</div>
<div class="line"><span class="lineno"> 212</span> </div>
<div class="line"><span class="lineno"> 213</span> std::srand(time(NULL));</div>
<div class="line"><span class="lineno"> 214</span> <span class="keywordflow">for</span> (i = 0; i &lt; NUM_DATA; i++) {</div>
<div class="line"><span class="lineno"> 215</span> <span class="comment">// allocate random numbers in the given range</span></div>
<div class="line"><span class="lineno"> 216</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = (std::rand() % range) - (range &gt;&gt; 1);</div>
<div class="line"><span class="lineno"> 217</span> }</div>
<div class="line"><span class="lineno"> 218</span> </div>
<div class="line"><span class="lineno"> 219</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted original data: &quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 220</span> <a class="code hl_function" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
<div class="line"><span class="lineno"> 221</span> std::clock_t start = std::clock();</div>
<div class="line"><span class="lineno"> 222</span> <a class="code hl_function" href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA); <span class="comment">// perform sorting</span></div>
<div class="line"><span class="lineno"> 223</span> std::clock_t end = std::clock();</div>
<div class="line"><span class="lineno"> 224</span> </div>
<div class="line"><span class="lineno"> 225</span> std::cout &lt;&lt; std::endl</div>
<div class="line"><span class="lineno"> 226</span> &lt;&lt; <span class="stringliteral">&quot;Data Sorted using custom implementation: &quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 227</span> <a class="code hl_function" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
<div class="line"><span class="lineno"> 228</span> </div>
<div class="line"><span class="lineno"> 229</span> <span class="keywordtype">double</span> elapsed_time = (end - start) * 1.f / CLOCKS_PER_SEC;</div>
<div class="line"><span class="lineno"> 230</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting: &quot;</span> &lt;&lt; elapsed_time &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span> &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 231</span> </div>
<div class="line"><span class="lineno"> 232</span> <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><span class="lineno"> 233</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 234</span>}</div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00138">quick_sort_3.cpp:138</a></div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a22ea0d1f7943ebb4371d31e44b465b6d"><div class="ttname"><a href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a></div><div class="ttdeci">void test_f(const int NUM_DATA)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00145">shell_sort2.cpp:145</a></div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a5669396c6a6b1e14b97589b6e37980aa"><div class="ttname"><a href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a></div><div class="ttdeci">void shell_sort(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00045">shell_sort2.cpp:45</a></div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a951127aea9d7e1e53ea9ae0868633246"><div class="ttname"><a href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a></div><div class="ttdeci">void show_data(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00018">shell_sort2.cpp:18</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a5669396c6a6b1e14b97589b6e37980aa" name="a5669396c6a6b1e14b97589b6e37980aa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5669396c6a6b1e14b97589b6e37980aa">&#9670;&#160;</a></span>shell_sort()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="memname">
<tr>
<td class="memname">void sorting::shell_sort </td>
<td>(</td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>LEN</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Optimized algorithm - takes half the time by utilizing Mar </p>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
<div class="line"><span class="lineno"> 46</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};</div>
<div class="line"><span class="lineno"> 47</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gap_len = 8;</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordtype">size_t</span> i, j, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
<div class="line"><span class="lineno"> 49</span> </div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">for</span> (g = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> &lt; gap_len; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>++) {</div>
<div class="line"><span class="lineno"> 51</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gap = gaps[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>];</div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">for</span> (i = gap; i &lt; LEN; i++) {</div>
<div class="line"><span class="lineno"> 53</span> T tmp = arr[i];</div>
<div class="line"><span class="lineno"> 54</span> </div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">for</span> (j = i; j &gt;= gap &amp;&amp; (arr[j - gap] - tmp) &gt; 0; j -= gap) {</div>
<div class="line"><span class="lineno"> 56</span> arr[j] = arr[j - gap];</div>
<div class="line"><span class="lineno"> 57</span> }</div>
<div class="line"><span class="lineno"> 58</span> </div>
<div class="line"><span class="lineno"> 59</span> arr[j] = tmp;</div>
<div class="line"><span class="lineno"> 60</span> }</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a951127aea9d7e1e53ea9ae0868633246" name="a951127aea9d7e1e53ea9ae0868633246"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a951127aea9d7e1e53ea9ae0868633246">&#9670;&#160;</a></span>show_data() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T&gt; </div>
<table class="memname">
<tr>
<td class="memname">void show_data </td>
<td>(</td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>LEN</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>pretty print array </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">arr</td><td>array to print </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">LEN</td><td>length of array to print </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 18</span> {</div>
<div class="line"><span class="lineno"> 19</span> <span class="keywordtype">size_t</span> i;</div>
<div class="line"><span class="lineno"> 20</span> </div>
<div class="line"><span class="lineno"> 21</span> <span class="keywordflow">for</span> (i = 0; i &lt; LEN; i++) {</div>
<div class="line"><span class="lineno"> 22</span> std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
<div class="line"><span class="lineno"> 23</span> }</div>
<div class="line"><span class="lineno"> 24</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 25</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a63aaff7cabfa3da2da8b9477b5fad9d6" name="a63aaff7cabfa3da2da8b9477b5fad9d6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a63aaff7cabfa3da2da8b9477b5fad9d6">&#9670;&#160;</a></span>show_data() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T, size_t N&gt; </div>
<table class="memname">
<tr>
<td class="memname">void show_data </td>
<td>(</td>
<td class="paramtype">T(&amp;)</td> <td class="paramname"><span class="paramname"><em>arr</em></span>[N]</td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>pretty print array </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">arr</td><td>array to print </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">N</td><td>length of array to print </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
<div class="line"><span class="lineno"> 33</span> <a class="code hl_function" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(arr, N);</div>
<div class="line"><span class="lineno"> 34</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a22ea0d1f7943ebb4371d31e44b465b6d" name="a22ea0d1f7943ebb4371d31e44b465b6d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a22ea0d1f7943ebb4371d31e44b465b6d">&#9670;&#160;</a></span>test_f()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void test_f </td>
<td>(</td>
<td class="paramtype">const int</td> <td class="paramname"><span class="paramname"><em>NUM_DATA</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Test implementation of shell_sort on float arrays by comparing results against std::qsort. </p>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 145</span> {</div>
<div class="line"><span class="lineno"> 146</span> <span class="comment">// int array = new int[NUM_DATA];</span></div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordtype">float</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">float</span>[NUM_DATA];</div>
<div class="line"><span class="lineno"> 148</span> <span class="keywordtype">float</span> *data2 = <span class="keyword">new</span> <span class="keywordtype">float</span>[NUM_DATA];</div>
<div class="line"><span class="lineno"> 149</span> <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordtype">int</span> range = 1000;</div>
<div class="line"><span class="lineno"> 151</span> </div>
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
<div class="line"><span class="lineno"> 153</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = ((std::rand() % range) - (range &gt;&gt; 1)) / 100.;</div>
<div class="line"><span class="lineno"> 154</span> }</div>
<div class="line"><span class="lineno"> 155</span> </div>
<div class="line"><span class="lineno"> 156</span> <span class="comment">/* sort using our implementation */</span></div>
<div class="line"><span class="lineno"> 157</span> std::clock_t start = std::clock();</div>
<div class="line"><span class="lineno"> 158</span> <a class="code hl_function" href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
<div class="line"><span class="lineno"> 159</span> std::clock_t end = std::clock();</div>
<div class="line"><span class="lineno"> 160</span> <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
<div class="line"><span class="lineno"> 161</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
<div class="line"><span class="lineno"> 162</span> &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 163</span> </div>
<div class="line"><span class="lineno"> 164</span> <span class="comment">/* sort using std::qsort */</span></div>
<div class="line"><span class="lineno"> 165</span> start = std::clock();</div>
<div class="line"><span class="lineno"> 166</span> std::qsort(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;float&gt;</a>);</div>
<div class="line"><span class="lineno"> 167</span> end = std::clock();</div>
<div class="line"><span class="lineno"> 168</span> </div>
<div class="line"><span class="lineno"> 169</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
<div class="line"><span class="lineno"> 170</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
<div class="line"><span class="lineno"> 171</span> &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 172</span> </div>
<div class="line"><span class="lineno"> 173</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
<div class="line"><span class="lineno"> 174</span> assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] == data2[i]); <span class="comment">// ensure that our sorting results match</span></div>
<div class="line"><span class="lineno"> 175</span> <span class="comment">// the standard results</span></div>
<div class="line"><span class="lineno"> 176</span> }</div>
<div class="line"><span class="lineno"> 177</span> </div>
<div class="line"><span class="lineno"> 178</span> <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><span class="lineno"> 179</span> <span class="keyword">delete</span>[] data2;</div>
<div class="line"><span class="lineno"> 180</span>}</div>
<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8e/huffman_8cpp_source.html#l00036">huffman.cpp:36</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a895b313cb2671e8f712040460325573e" name="a895b313cb2671e8f712040460325573e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a895b313cb2671e8f712040460325573e">&#9670;&#160;</a></span>test_int()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void test_int </td>
<td>(</td>
<td class="paramtype">const int</td> <td class="paramname"><span class="paramname"><em>NUM_DATA</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Test implementation of shell_sort on integer arrays by comparing results against std::qsort. </p>
<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 105</span> {</div>
<div class="line"><span class="lineno"> 106</span> <span class="comment">// int array = new int[NUM_DATA];</span></div>
<div class="line"><span class="lineno"> 107</span> <span class="keywordtype">int</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordtype">int</span> *data2 = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
<div class="line"><span class="lineno"> 109</span> <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordtype">int</span> range = 1800;</div>
<div class="line"><span class="lineno"> 111</span> </div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++)</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = (std::rand() % range) - (range &gt;&gt; 1);</div>
<div class="line"><span class="lineno"> 114</span> </div>
<div class="line"><span class="lineno"> 115</span> <span class="comment">/* sort using our implementation */</span></div>
<div class="line"><span class="lineno"> 116</span> std::clock_t start = std::clock();</div>
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
<div class="line"><span class="lineno"> 118</span> std::clock_t end = std::clock();</div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
<div class="line"><span class="lineno"> 120</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
<div class="line"><span class="lineno"> 121</span> &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 122</span> </div>
<div class="line"><span class="lineno"> 123</span> <span class="comment">/* sort using std::qsort */</span></div>
<div class="line"><span class="lineno"> 124</span> start = std::clock();</div>
<div class="line"><span class="lineno"> 125</span> std::qsort(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;int&gt;</a>);</div>
<div class="line"><span class="lineno"> 126</span> end = std::clock();</div>
<div class="line"><span class="lineno"> 127</span> </div>
<div class="line"><span class="lineno"> 128</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
<div class="line"><span class="lineno"> 129</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
<div class="line"><span class="lineno"> 130</span> &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 131</span> </div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
<div class="line"><span class="lineno"> 133</span> assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] == data2[i]); <span class="comment">// ensure that our sorting results match</span></div>
<div class="line"><span class="lineno"> 134</span> <span class="comment">// the standard results</span></div>
<div class="line"><span class="lineno"> 135</span> }</div>
<div class="line"><span class="lineno"> 136</span> </div>
<div class="line"><span class="lineno"> 137</span> <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><span class="lineno"> 138</span> <span class="keyword">delete</span>[] data2;</div>
<div class="line"><span class="lineno"> 139</span>}</div>
</div><!-- fragment -->
</div>
</div>
</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="../../d4/d7a/shell__sort2_8cpp.html">shell_sort2.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>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink