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

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
d4/d7a/shell__sort2_8cpp.html
View File

@@ -3,7 +3,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.9.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/shell_sort2.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -153,7 +153,7 @@ Functions</h2></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><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>
<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>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a7eb77daed2cf1513f6d68c47a1c2db1c" name="a7eb77daed2cf1513f6d68c47a1c2db1c"></a>
@@ -183,7 +183,7 @@ template&lt;typename T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >function to compare sorting using cstdlib's qsort </p>
<p>function to compare sorting using cstdlib's qsort </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>
@@ -225,7 +225,7 @@ template&lt;typename T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<p>Main function </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> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(NULL));</div>
@@ -328,7 +328,7 @@ template&lt;class T &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >pretty print array </p><dl class="params"><dt>Parameters</dt><dd>
<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>
@@ -369,7 +369,7 @@ template&lt;typename T , size_t N&gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p >pretty print array </p><dl class="params"><dt>Parameters</dt><dd>
<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>
@@ -403,7 +403,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Test implementation of shell_sort on float arrays by comparing results against <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a>. </p>
<p>Test implementation of shell_sort on float arrays by comparing results against <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</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>
@@ -466,7 +466,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Test implementation of shell_sort on integer arrays by comparing results against <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a>. </p>
<p>Test implementation of shell_sort on integer arrays by comparing results against <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</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>
@@ -517,7 +517,7 @@ Here is the call graph for this function:</div>
<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.9.5 </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.9.6 </li>
</ul>
</div>
</body>