mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
312 lines
31 KiB
HTML
312 lines
31 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.12.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: sorting/quick_sort.cpp Source File</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"> 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.12.0 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&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&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&dn=expat.txt MIT */
|
|
$(function(){initNavTree('d1/d21/quick__sort_8cpp_source.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="headertitle"><div class="title">quick_sort.cpp</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d1/d21/quick__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <algorithm></span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include <cassert></span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include <ctime></span> </div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include <iostream></span> </div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include <vector></span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a> {</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82"> 59</a></span><span class="keywordtype">int</span> partition(std::vector<T> *arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &low, <span class="keyword">const</span> <span class="keywordtype">int</span> &high) {</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> T pivot = (*arr)[high]; <span class="comment">// taking the last element as pivot</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordtype">int</span> i = (low - 1); <span class="comment">// Index of smaller element</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = low; j < high; j++) {</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// If current element is smaller than or</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// equal to pivot</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">if</span> ((*arr)[j] <= pivot) {</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> i++; <span class="comment">// increment index of smaller element</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> std::swap((*arr)[i], (*arr)[j]);</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> }</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> std::swap((*arr)[i + 1], (*arr)[high]);</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> (i + 1);</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> </div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394"> 87</a></span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(std::vector<T> *arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &low, <span class="keyword">const</span> <span class="keywordtype">int</span> &high) {</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">if</span> (low < high) {</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordtype">int</span> p = partition(arr, low, high);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(arr, low, p - 1);</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(arr, p + 1, high);</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> }</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05"> 107</a></span>std::vector<T> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(std::vector<T> arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &low, <span class="keyword">const</span> <span class="keywordtype">int</span> &high) {</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">if</span> (low < high) {</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordtype">int</span> p = partition(&arr, low, high);</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> </div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&arr, low, p - 1);</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&arr, p + 1, high);</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">return</span> arr;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span><span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b"> 124</a></span><span class="keywordtype">void</span> show(<span class="keyword">const</span> std::vector<T> &arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &size) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) std::cout << arr[i] << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span>} <span class="comment">// namespace quick_sort</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span>} <span class="comment">// namespace sorting</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> </div>
|
|
<div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"> 136</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// 1st test (normal numbers)</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> std::vector<uint64_t> arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> std::vector<uint64_t> arr_sorted = sorting::quick_sort::quick_sort(</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> arr, 0, <span class="keywordtype">int</span>(std::end(arr) - std::begin(arr)) - 1);</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> assert(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::cout << <span class="stringliteral">"\n1st test: passed!\n"</span>;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> </div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// 2nd test (normal and negative numbers)</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> std::vector<int64_t> arr2 = {9, 15, 28, 96, 500, -4, -58,</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> -977, -238, -800, -21, -53, -55};</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> std::vector<int64_t> arr_sorted2 = sorting::quick_sort::quick_sort(</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> arr2, 0, std::end(arr2) - std::begin(arr2));</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> assert(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> std::cout << <span class="stringliteral">"2nd test: passed!\n"</span>;</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// 3rd test (decimal and normal numbers)</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector<double> arr3 = {29, 36, 1100, 0, 77, 1,</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> 6.7, 8.97, 1.74, 950.10, -329.65};</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> std::vector<double> arr_sorted3 = sorting::quick_sort::quick_sort(</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> arr3, 0, <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> assert(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> std::cout << <span class="stringliteral">"3rd test: passed!\n"</span>;</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> </div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// 4th test (random decimal and negative numbers)</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordtype">size_t</span> size = std::rand() % 750 + 100;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> </div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> std::vector<float> arr4(size);</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < size; i++) {</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> arr4[i] = <span class="keyword">static_cast<</span><span class="keywordtype">float</span><span class="keyword">></span>(std::rand()) /</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keyword">static_cast<</span><span class="keywordtype">float</span><span class="keyword">></span>(RAND_MAX / 999.99 - 0.99) -</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> 250;</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> }</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> </div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> std::vector<float> arr4_sorted = sorting::quick_sort::quick_sort(</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> arr4, 0, <span class="keywordtype">int</span>(std::end(arr4) - std::begin(arr4)) - 1);</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> assert(std::is_sorted(std::begin(arr4_sorted), std::end(arr4_sorted)));</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> std::cout << <span class="stringliteral">"4th test: passed!\n"</span>;</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// Printing all sorted arrays</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> std::cout << <span class="stringliteral">"\n\tPrinting all sorted arrays:\t\n"</span>;</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> std::cout << <span class="stringliteral">"1st array:\n"</span>;</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> sorting::quick_sort::show(arr_sorted, std::end(arr) - std::begin(arr));</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> std::cout << <span class="stringliteral">"2nd array:\n"</span>;</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> sorting::quick_sort::show(arr_sorted2, std::end(arr2) - std::begin(arr2));</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> std::cout << <span class="stringliteral">"3rd array:\n"</span>;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> sorting::quick_sort::show(arr_sorted3,</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> std::cout << std::endl;</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> std::cout << <span class="stringliteral">"Start: 4th array:\n\n"</span>;</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> sorting::quick_sort::show(</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> arr4_sorted, <span class="keywordtype">int</span>(std::end(arr4_sorted) - std::begin(arr4_sorted)) - 1);</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> std::cout << <span class="stringliteral">"\nEnd: 4th array.\n"</span>;</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
|
|
<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 202</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordtype">int</span> choice = 0;</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> std::cout << <span class="stringliteral">"\tAvailable modes\t\n\n"</span>;</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> std::cout << <span class="stringliteral">"1. Self-tests mode\n2. Interactive mode"</span>;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> </div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> std::cout << <span class="stringliteral">"\nChoose a mode: "</span>;</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> std::cin >> choice;</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">while</span> ((choice != 1) && (choice != 2)) {</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> std::cout << <span class="stringliteral">"Invalid option. Choose between the valid modes: "</span>;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> std::cin >> choice;</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> }</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordflow">if</span> (choice == 1) {</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> std::srand(std::time(<span class="keyword">nullptr</span>));</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <a class="code hl_function" href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keywordtype">int</span> size = 0;</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> std::cout << <span class="stringliteral">"\nEnter the number of elements: "</span>;</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> </div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> std::cin >> size;</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> std::vector<float> arr(size);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> </div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> std::cout</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> << <span class="stringliteral">"\nEnter the unsorted elements (can be negative/decimal): "</span>;</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> </div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> std::cin >> arr[i];</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> sorting::quick_sort::quick_sort(&arr, 0, size - 1);</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> std::cout << <span class="stringliteral">"\nSorted array: \n"</span>;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> sorting::quick_sort::show(arr, size);</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> }</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span>}</div>
|
|
</div>
|
|
<div class="ttc" id="anamespacequick__sort_html"><div class="ttname"><a href="../../d0/d2b/namespacequick__sort.html">quick_sort</a></div><div class="ttdoc">Functions for the Quick sort implementation in C++.</div></div>
|
|
<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
|
|
<div class="ttc" id="aquick__sort_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00136">quick_sort.cpp:136</a></div></div>
|
|
<div class="ttc" id="aquick__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00202">quick_sort.cpp:202</a></div></div>
|
|
</div><!-- fragment --></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="../../d1/d21/quick__sort_8cpp.html">quick_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>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|