mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
Documentation for c26eea874d
This commit is contained in:
@@ -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.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: sorting/comb_sort.cpp File Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -203,14 +203,14 @@ Functions</h2></td></tr>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
|
||||
<div class="line"><span class="lineno"> 51</span> <span class="keywordtype">int</span> gap = r;</div>
|
||||
<div class="line"><span class="lineno"> 52</span> </div>
|
||||
<div class="line"><span class="lineno"> 52</span></div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordtype">bool</span> swapped = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 55</span> </div>
|
||||
<div class="line"><span class="lineno"> 55</span></div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">while</span> (gap != 1 || swapped) {</div>
|
||||
<div class="line"><span class="lineno"> 59</span> gap = <a class="code hl_function" href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(gap);</div>
|
||||
<div class="line"><span class="lineno"> 60</span> </div>
|
||||
<div class="line"><span class="lineno"> 61</span> swapped = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 62</span> </div>
|
||||
<div class="line"><span class="lineno"> 62</span></div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = l; i < r - gap; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">if</span> (arr[i] > arr[i + gap]) {</div>
|
||||
<div class="line"><span class="lineno"> 66</span> std::swap(arr[i], arr[i + gap]);</div>
|
||||
@@ -275,7 +275,7 @@ Functions</h2></td></tr>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 88</span> {</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
|
||||
<div class="line"><span class="lineno"> 91</span> </div>
|
||||
<div class="line"><span class="lineno"> 91</span></div>
|
||||
<div class="line"><span class="lineno"> 93</span> <span class="keywordtype">int</span> n;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> std::cin >> n;</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
|
||||
@@ -313,7 +313,7 @@ Functions</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr1, 0, 10);</div>
|
||||
<div class="line"><span class="lineno"> 77</span> assert(std::is_sorted(arr1, arr1 + 10));</div>
|
||||
<div class="line"><span class="lineno"> 78</span> std::cout << <span class="stringliteral">"Test 1 passed\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 79</span> </div>
|
||||
<div class="line"><span class="lineno"> 79</span></div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">int</span> arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr2, 0, 8);</div>
|
||||
<div class="line"><span class="lineno"> 83</span> assert(std::is_sorted(arr2, arr2 + 8));</div>
|
||||
@@ -328,7 +328,7 @@ Functions</h2></td></tr>
|
||||
<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="../../d9/dfd/comb__sort_8cpp.html">comb_sort.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
|
||||
<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>
|
||||
|
||||
Reference in New Issue
Block a user