backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-24 05:42:59 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 8b1eab204b

Browse Source
This commit is contained in:
realstealthninja
2024-11-04 12:43:05 +00:00
parent 4fb6e622e9
commit a7bccf7d01
6732 changed files with 153919 additions and 365711 deletions
Download Patch File Download Diff File Expand all files Collapse all files

222
d1/d21/quick__sort_8cpp.html
View File

@@ -1,3 +1,4 @@
<!-- 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>
@@ -5,10 +6,15 @@
<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>Algorithms_in_C++: sorting/quick_sort.cpp File Reference</title>
<title>TheAlgorithms/C++: sorting/quick_sort.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>
@@ -18,14 +24,24 @@
<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/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
<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" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></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! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<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">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
@@ -124,7 +141,9 @@ Include dependency graph for quick_sort.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db2/quick__sort_8cpp__incl.svg" width="512" 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><table class="memberdecls">
</div>
<p><a href="../../d1/d21/quick__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>
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>
@@ -137,19 +156,19 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82" id="r_a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">sorting::quick_sort::partition</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">sorting::quick_sort::partition</a> (std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
<tr class="memdesc:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sorts the array taking the last element as pivot. <br /></td></tr>
<tr class="separator:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394" id="r_a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a> (std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
<tr class="memdesc:a5e6213e8008356ac6eda9427f3f4b394"><td class="mdescLeft">&#160;</td><td class="mdescRight">the main function that implements Quick Sort. <br /></td></tr>
<tr class="separator:a5e6213e8008356ac6eda9427f3f4b394"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05" id="r_a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a53adad7e4d83e1495df25fe8dbb4cc05">sorting::quick_sort::quick_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; arr, const int &amp;low, const int &amp;high)</td></tr>
<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a53adad7e4d83e1495df25fe8dbb4cc05">sorting::quick_sort::quick_sort</a> (std::vector&lt; T &gt; arr, const int &amp;low, const int &amp;high)</td></tr>
<tr class="memdesc:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="mdescLeft">&#160;</td><td class="mdescRight">the main function that implements Quick Sort. <br /></td></tr>
<tr class="separator:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b" id="r_aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, const int &amp;size)</td></tr>
<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a> (const std::vector&lt; T &gt; &amp;arr, const int &amp;size)</td></tr>
<tr class="memdesc:aeccefcf6fcca62c54939c5ec9a93109b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the array contents. <br /></td></tr>
<tr class="separator:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -174,6 +193,8 @@ Functions</h2></td></tr>
</pre><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd>
<dd>
<a href="https://github.com/popoapp" target="_blank">popoapp</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -192,58 +213,50 @@ Functions</h2></td></tr>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00202">202</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 202</span> {</div>
<div class="line"><span class="lineno"> 203</span> <span class="keywordtype">int</span> choice = 0;</div>
<div class="line"><span class="lineno"> 204</span> </div>
<div class="line"><span class="lineno"> 205</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tAvailable modes\t\n\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 206</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Self-tests mode\n2. Interactive mode&quot;</span>;</div>
<div class="line"><span class="lineno"> 205</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\tAvailable modes\t\n\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 206</span> std::cout &lt;&lt; <span class="stringliteral">&quot;1. Self-tests mode\n2. Interactive mode&quot;</span>;</div>
<div class="line"><span class="lineno"> 207</span> </div>
<div class="line"><span class="lineno"> 208</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nChoose a mode: &quot;</span>;</div>
<div class="line"><span class="lineno"> 209</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
<div class="line"><span class="lineno"> 210</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 208</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nChoose a mode: &quot;</span>;</div>
<div class="line"><span class="lineno"> 209</span> std::cin &gt;&gt; choice;</div>
<div class="line"><span class="lineno"> 210</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 211</span> </div>
<div class="line"><span class="lineno"> 212</span> <span class="keywordflow">while</span> ((choice != 1) &amp;&amp; (choice != 2)) {</div>
<div class="line"><span class="lineno"> 213</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Invalid option. Choose between the valid modes: &quot;</span>;</div>
<div class="line"><span class="lineno"> 214</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
<div class="line"><span class="lineno"> 213</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Invalid option. Choose between the valid modes: &quot;</span>;</div>
<div class="line"><span class="lineno"> 214</span> std::cin &gt;&gt; choice;</div>
<div class="line"><span class="lineno"> 215</span> }</div>
<div class="line"><span class="lineno"> 216</span> </div>
<div class="line"><span class="lineno"> 217</span> <span class="keywordflow">if</span> (choice == 1) {</div>
<div class="line"><span class="lineno"> 218</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>(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 218</span> std::srand(std::time(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 219</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 220</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
<div class="line"><span class="lineno"> 221</span> <span class="keywordtype">int</span> size = 0;</div>
<div class="line"><span class="lineno"> 222</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements: &quot;</span>;</div>
<div class="line"><span class="lineno"> 222</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements: &quot;</span>;</div>
<div class="line"><span class="lineno"> 223</span> </div>
<div class="line"><span class="lineno"> 224</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; size;</div>
<div class="line"><span class="lineno"> 225</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr(size);</div>
<div class="line"><span class="lineno"> 224</span> std::cin &gt;&gt; size;</div>
<div class="line"><span class="lineno"> 225</span> std::vector&lt;float&gt; arr(size);</div>
<div class="line"><span class="lineno"> 226</span> </div>
<div class="line"><span class="lineno"> 227</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
<div class="line"><span class="lineno"> 227</span> std::cout</div>
<div class="line"><span class="lineno"> 228</span> &lt;&lt; <span class="stringliteral">&quot;\nEnter the unsorted elements (can be negative/decimal): &quot;</span>;</div>
<div class="line"><span class="lineno"> 229</span> </div>
<div class="line"><span class="lineno"> 230</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><span class="lineno"> 231</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
<div class="line"><span class="lineno"> 231</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 232</span> std::cin &gt;&gt; arr[i];</div>
<div class="line"><span class="lineno"> 233</span> }</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(&amp;arr, 0, size - 1);</div>
<div class="line"><span class="lineno"> 235</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nSorted array: \n&quot;</span>;</div>
<div class="line"><span class="lineno"> 235</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nSorted array: \n&quot;</span>;</div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr, size);</div>
<div class="line"><span class="lineno"> 237</span> }</div>
<div class="line"><span class="lineno"> 238</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 239</span>}</div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aquick__sort_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> quick_sort.cpp:136</div></div>
<div class="ttc" id="aquick__sort_8cpp_html_a5e6213e8008356ac6eda9427f3f4b394"><div class="ttname"><a href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a></div><div class="ttdeci">void quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</div><div class="ttdoc">the main function that implements Quick Sort.</div><div class="ttdef"><b>Definition</b> quick_sort.cpp:87</div></div>
<div class="ttc" id="aquick__sort_8cpp_html_aeccefcf6fcca62c54939c5ec9a93109b"><div class="ttname"><a href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a></div><div class="ttdeci">void show(const std::vector&lt; T &gt; &amp;arr, const int &amp;size)</div><div class="ttdoc">Utility function to print the array contents.</div><div class="ttdef"><b>Definition</b> quick_sort.cpp:124</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="336" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="aquick__sort_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#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="../../d1/d21/quick__sort_8cpp_source.html#l00136">quick_sort.cpp:136</a></div></div>
<div class="ttc" id="aquick__sort_8cpp_html_a5e6213e8008356ac6eda9427f3f4b394"><div class="ttname"><a href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a></div><div class="ttdeci">void quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</div><div class="ttdoc">the main function that implements Quick Sort.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d21/quick__sort_8cpp_source.html#l00087">quick_sort.cpp:87</a></div></div>
<div class="ttc" id="aquick__sort_8cpp_html_aeccefcf6fcca62c54939c5ec9a93109b"><div class="ttname"><a href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a></div><div class="ttdeci">void show(const std::vector&lt; T &gt; &amp;arr, const int &amp;size)</div><div class="ttdoc">Utility function to print the array contents.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d21/quick__sort_8cpp_source.html#l00124">quick_sort.cpp:124</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a1b2a2cc2d319240f3b65c5b2f479ed82" name="a1b2a2cc2d319240f3b65c5b2f479ed82"></a>
@@ -257,7 +270,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">int sorting::quick_sort::partition </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
<td class="paramtype">std::vector&lt; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -288,6 +301,8 @@ template&lt;typename T &gt; </div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>index of the smaller element </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> T pivot = (*arr)[high]; <span class="comment">// taking the last element as pivot</span></div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordtype">int</span> i = (low - 1); <span class="comment">// Index of smaller element</span></div>
@@ -297,20 +312,14 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 65</span> <span class="comment">// equal to pivot</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> ((*arr)[j] &lt;= pivot) {</div>
<div class="line"><span class="lineno"> 67</span> i++; <span class="comment">// increment index of smaller element</span></div>
<div class="line"><span class="lineno"> 68</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>((*arr)[i], (*arr)[j]);</div>
<div class="line"><span class="lineno"> 68</span> std::swap((*arr)[i], (*arr)[j]);</div>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="line"><span class="lineno"> 70</span> }</div>
<div class="line"><span class="lineno"> 71</span> </div>
<div class="line"><span class="lineno"> 72</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>((*arr)[i + 1], (*arr)[high]);</div>
<div class="line"><span class="lineno"> 72</span> std::swap((*arr)[i + 1], (*arr)[high]);</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> (i + 1);</div>
<div class="line"><span class="lineno"> 74</span>}</div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg" width="266" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
<a id="a5e6213e8008356ac6eda9427f3f4b394" name="a5e6213e8008356ac6eda9427f3f4b394"></a>
@@ -324,7 +333,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::quick_sort::quick_sort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
<td class="paramtype">std::vector&lt; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -354,16 +363,17 @@ template&lt;typename T &gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">if</span> (low &lt; high) {</div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordtype">int</span> p = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a>(arr, low, high);</div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordtype">int</span> p = partition(arr, low, high);</div>
<div class="line"><span class="lineno"> 90</span> </div>
<div class="line"><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"><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"><span class="lineno"> 93</span> }</div>
<div class="line"><span class="lineno"> 94</span>}</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="apartition_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/partition.html">std::partition</a></div><div class="ttdeci">T partition(T... args)</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -376,9 +386,9 @@ template&lt;typename T &gt; </div>
template&lt;typename T &gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::quick_sort::quick_sort </td>
<td class="memname">std::vector&lt; T &gt; sorting::quick_sort::quick_sort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
<td class="paramtype">std::vector&lt; T &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -408,9 +418,11 @@ template&lt;typename T &gt; </div>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 107</span> {</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (low &lt; high) {</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordtype">int</span> p = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a>(&amp;arr, low, high);</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordtype">int</span> p = partition(&amp;arr, low, high);</div>
<div class="line"><span class="lineno"> 110</span> </div>
<div class="line"><span class="lineno"> 111</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&amp;arr, low, p - 1);</div>
<div class="line"><span class="lineno"> 112</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&amp;arr, p + 1, high);</div>
@@ -431,7 +443,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::quick_sort::show </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
<td class="paramtype">const std::vector&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
@@ -450,9 +462,11 @@ template&lt;typename T &gt; </div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 124</span> {</div>
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 126</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 127</span>}</div>
</div><!-- fragment -->
</div>
@@ -482,78 +496,70 @@ template&lt;typename T &gt; </div>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00136">136</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 136</span> {</div>
<div class="line"><span class="lineno"> 137</span> <span class="comment">// 1st test (normal numbers)</span></div>
<div class="line"><span class="lineno"> 138</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> arr_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 140</span> arr, 0, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr)) - 1);</div>
<div class="line"><span class="lineno"> 138</span> std::vector&lt;uint64_t&gt; arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
<div class="line"><span class="lineno"> 139</span> std::vector&lt;uint64_t&gt; arr_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 140</span> arr, 0, <span class="keywordtype">int</span>(std::end(arr) - std::begin(arr)) - 1);</div>
<div class="line"><span class="lineno"> 141</span> </div>
<div class="line"><span class="lineno"> 142</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr_sorted), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr_sorted)));</div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1st test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 142</span> assert(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));</div>
<div class="line"><span class="lineno"> 143</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n1st test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 144</span> </div>
<div class="line"><span class="lineno"> 145</span> <span class="comment">// 2nd test (normal and negative numbers)</span></div>
<div class="line"><span class="lineno"> 146</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr2 = {9, 15, 28, 96, 500, -4, -58,</div>
<div class="line"><span class="lineno"> 146</span> std::vector&lt;int64_t&gt; arr2 = {9, 15, 28, 96, 500, -4, -58,</div>
<div class="line"><span class="lineno"> 147</span> -977, -238, -800, -21, -53, -55};</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr_sorted2 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 149</span> arr2, 0, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2));</div>
<div class="line"><span class="lineno"> 148</span> std::vector&lt;int64_t&gt; arr_sorted2 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 149</span> arr2, 0, std::end(arr2) - std::begin(arr2));</div>
<div class="line"><span class="lineno"> 150</span> </div>
<div class="line"><span class="lineno"> 151</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr_sorted2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr_sorted2)));</div>
<div class="line"><span class="lineno"> 152</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 151</span> assert(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));</div>
<div class="line"><span class="lineno"> 152</span> std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 153</span> </div>
<div class="line"><span class="lineno"> 154</span> <span class="comment">// 3rd test (decimal and normal numbers)</span></div>
<div class="line"><span class="lineno"> 155</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr3 = {29, 36, 1100, 0, 77, 1,</div>
<div class="line"><span class="lineno"> 155</span> std::vector&lt;double&gt; arr3 = {29, 36, 1100, 0, 77, 1,</div>
<div class="line"><span class="lineno"> 156</span> 6.7, 8.97, 1.74, 950.10, -329.65};</div>
<div class="line"><span class="lineno"> 157</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr_sorted3 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 158</span> arr3, 0, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3)) - 1);</div>
<div class="line"><span class="lineno"> 157</span> std::vector&lt;double&gt; arr_sorted3 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 158</span> arr3, 0, <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
<div class="line"><span class="lineno"> 159</span> </div>
<div class="line"><span class="lineno"> 160</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr_sorted3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr_sorted3)));</div>
<div class="line"><span class="lineno"> 161</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 160</span> assert(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));</div>
<div class="line"><span class="lineno"> 161</span> std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 162</span> </div>
<div class="line"><span class="lineno"> 163</span> <span class="comment">// 4th test (random decimal and negative numbers)</span></div>
<div class="line"><span class="lineno"> 164</span> <span class="keywordtype">size_t</span> size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 750 + 100;</div>
<div class="line"><span class="lineno"> 164</span> <span class="keywordtype">size_t</span> size = std::rand() % 750 + 100;</div>
<div class="line"><span class="lineno"> 165</span> </div>
<div class="line"><span class="lineno"> 166</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4(size);</div>
<div class="line"><span class="lineno"> 166</span> std::vector&lt;float&gt; arr4(size);</div>
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
<div class="line"><span class="lineno"> 168</span> arr4[i] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>()) /</div>
<div class="line"><span class="lineno"> 168</span> arr4[i] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(std::rand()) /</div>
<div class="line"><span class="lineno"> 169</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(RAND_MAX / 999.99 - 0.99) -</div>
<div class="line"><span class="lineno"> 170</span> 250;</div>
<div class="line"><span class="lineno"> 171</span> }</div>
<div class="line"><span class="lineno"> 172</span> </div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 174</span> arr4, 0, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4)) - 1);</div>
<div class="line"><span class="lineno"> 175</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4_sorted), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4_sorted)));</div>
<div class="line"><span class="lineno"> 173</span> std::vector&lt;float&gt; arr4_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
<div class="line"><span class="lineno"> 174</span> arr4, 0, <span class="keywordtype">int</span>(std::end(arr4) - std::begin(arr4)) - 1);</div>
<div class="line"><span class="lineno"> 175</span> assert(std::is_sorted(std::begin(arr4_sorted), std::end(arr4_sorted)));</div>
<div class="line"><span class="lineno"> 176</span> </div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 177</span> std::cout &lt;&lt; <span class="stringliteral">&quot;4th test: passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 178</span> </div>
<div class="line"><span class="lineno"> 179</span> <span class="comment">// Printing all sorted arrays</span></div>
<div class="line"><span class="lineno"> 180</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\tPrinting all sorted arrays:\t\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 180</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tPrinting all sorted arrays:\t\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 181</span> </div>
<div class="line"><span class="lineno"> 182</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st array:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 183</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr));</div>
<div class="line"><span class="lineno"> 184</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 185</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd array:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted2, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2));</div>
<div class="line"><span class="lineno"> 187</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 188</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd array:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 182</span> std::cout &lt;&lt; <span class="stringliteral">&quot;1st array:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 183</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted, std::end(arr) - std::begin(arr));</div>
<div class="line"><span class="lineno"> 184</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 185</span> std::cout &lt;&lt; <span class="stringliteral">&quot;2nd array:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted2, std::end(arr2) - std::begin(arr2));</div>
<div class="line"><span class="lineno"> 187</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 188</span> std::cout &lt;&lt; <span class="stringliteral">&quot;3rd array:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted3,</div>
<div class="line"><span class="lineno"> 190</span> <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3)) - 1);</div>
<div class="line"><span class="lineno"> 191</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Start: 4th array:\n\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 190</span> <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
<div class="line"><span class="lineno"> 191</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 192</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Start: 4th array:\n\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(</div>
<div class="line"><span class="lineno"> 194</span> arr4_sorted, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4_sorted) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4_sorted)) - 1);</div>
<div class="line"><span class="lineno"> 195</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnd: 4th array.\n&quot;</span>;</div>
<div class="line"><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"><span class="lineno"> 195</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnd: 4th array.\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 196</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="210" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->