mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
577 lines
41 KiB
HTML
577 lines
41 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.13.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<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>
|
|
<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.13.2 -->
|
|
<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.html','../../'); initResizable(true); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#namespaces">Namespaces</a> |
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle"><div class="title">quick_sort.cpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p><a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <algorithm></code><br />
|
|
<code>#include <cassert></code><br />
|
|
<code>#include <cstdint></code><br />
|
|
<code>#include <ctime></code><br />
|
|
<code>#include <iostream></code><br />
|
|
<code>#include <vector></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
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>
|
|
<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  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
|
|
<tr class="memdesc:d5/d91/namespacesorting"><td class="mdescLeft"> </td><td class="mdescRight">for working with vectors <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a></td></tr>
|
|
<tr class="memdesc:d0/d2b/namespacequick__sort"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82" id="r_a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplParams" colspan="2">template<typename T> </td></tr>
|
|
<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplItemLeft" align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">sorting::quick_sort::partition</a> (std::vector< T > *arr, const int &low, const int &high)</td></tr>
|
|
<tr class="memdesc:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="mdescLeft"> </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"> </td></tr>
|
|
<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394" id="r_a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplParams" colspan="2">template<typename T> </td></tr>
|
|
<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a> (std::vector< T > *arr, const int &low, const int &high)</td></tr>
|
|
<tr class="memdesc:a5e6213e8008356ac6eda9427f3f4b394"><td class="mdescLeft"> </td><td class="mdescRight">the main function that implements Quick Sort. <br /></td></tr>
|
|
<tr class="separator:a5e6213e8008356ac6eda9427f3f4b394"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05" id="r_a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplParams" colspan="2">template<typename T> </td></tr>
|
|
<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplItemLeft" align="right" valign="top">std::vector< T > </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a53adad7e4d83e1495df25fe8dbb4cc05">sorting::quick_sort::quick_sort</a> (std::vector< T > arr, const int &low, const int &high)</td></tr>
|
|
<tr class="memdesc:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="mdescLeft"> </td><td class="mdescRight">the main function that implements Quick Sort. <br /></td></tr>
|
|
<tr class="separator:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b" id="r_aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplParams" colspan="2">template<typename T> </td></tr>
|
|
<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a> (const std::vector< T > &arr, const int &size)</td></tr>
|
|
<tr class="memdesc:aeccefcf6fcca62c54939c5ec9a93109b"><td class="mdescLeft"> </td><td class="mdescRight">Utility function to print the array contents. <br /></td></tr>
|
|
<tr class="separator:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
|
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <br /></td></tr>
|
|
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
|
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </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/Quicksort" target="_blank">Quick sort implementation</a> in C++ </p>
|
|
<p>Quick Sort is a <a href="https://en.wikipedia.org/wiki/Category:Divide-and-conquer_algorithms" target="_blank">divide and conquer algorithm</a>. It picks an element as pivot and partition the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways. </p><pre class="fragment"> 1. Always pick the first element as pivot
|
|
2. Always pick the last element as pivot (implemented below)
|
|
3. Pick a random element as pivot
|
|
4. Pick median as pivot
|
|
|
|
The key process in quickSort is partition(). Target of partition is,
|
|
given an array and an element x(say) of array as pivot, put x at it's
|
|
correct position in sorted array and put all smaller elements (samller
|
|
than x) before x, and put all greater elements (greater than x) after
|
|
x. All this should be done in linear time
|
|
</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">◆ </a></span>main()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int main </td>
|
|
<td>(</td>
|
|
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<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> std::cout << <span class="stringliteral">"\tAvailable modes\t\n\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 206</span> std::cout << <span class="stringliteral">"1. Self-tests mode\n2. Interactive mode"</span>;</div>
|
|
<div class="line"><span class="lineno"> 207</span> </div>
|
|
<div class="line"><span class="lineno"> 208</span> std::cout << <span class="stringliteral">"\nChoose a mode: "</span>;</div>
|
|
<div class="line"><span class="lineno"> 209</span> std::cin >> choice;</div>
|
|
<div class="line"><span class="lineno"> 210</span> std::cout << <span class="stringliteral">"\n"</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) && (choice != 2)) {</div>
|
|
<div class="line"><span class="lineno"> 213</span> std::cout << <span class="stringliteral">"Invalid option. Choose between the valid modes: "</span>;</div>
|
|
<div class="line"><span class="lineno"> 214</span> std::cin >> 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> 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> std::cout << <span class="stringliteral">"\nEnter the number of elements: "</span>;</div>
|
|
<div class="line"><span class="lineno"> 223</span> </div>
|
|
<div class="line"><span class="lineno"> 224</span> std::cin >> size;</div>
|
|
<div class="line"><span class="lineno"> 225</span> std::vector<float> arr(size);</div>
|
|
<div class="line"><span class="lineno"> 226</span> </div>
|
|
<div class="line"><span class="lineno"> 227</span> std::cout</div>
|
|
<div class="line"><span class="lineno"> 228</span> << <span class="stringliteral">"\nEnter the unsorted elements (can be negative/decimal): "</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 < size; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 231</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 232</span> std::cin >> 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>(&arr, 0, size - 1);</div>
|
|
<div class="line"><span class="lineno"> 235</span> std::cout << <span class="stringliteral">"\nSorted array: \n"</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="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< T > *arr, const int &low, const int &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< T > &arr, const int &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>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a1b2a2cc2d319240f3b65c5b2f479ed82">◆ </a></span>partition()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int sorting::quick_sort::partition </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< T > *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>low</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>high</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Sorts the array taking the last element as pivot. </p>
|
|
<p>This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">T</td><td>array type </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">arr</td><td>the array with contents given by the user </td></tr>
|
|
<tr><td class="paramname">low</td><td>first point of the array (starting index) </td></tr>
|
|
<tr><td class="paramname">high</td><td>last point of the array (ending index) </td></tr>
|
|
</table>
|
|
</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>
|
|
<div class="line"><span class="lineno"> 62</span> </div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = low; j < high; j++) {</div>
|
|
<div class="line"><span class="lineno"> 64</span> <span class="comment">// If current element is smaller than or</span></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] <= 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> 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> 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><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a5e6213e8008356ac6eda9427f3f4b394" name="a5e6213e8008356ac6eda9427f3f4b394"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a5e6213e8008356ac6eda9427f3f4b394">◆ </a></span>quick_sort() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void sorting::quick_sort::quick_sort </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< T > *</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>low</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>high</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>the main function that implements Quick Sort. </p>
|
|
<p>Void function used in T (array type) function, which then can be used as self-tests or other functionalities. </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">T</td><td>array type </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">arr</td><td>array to be sorted </td></tr>
|
|
<tr><td class="paramname">low</td><td>starting index </td></tr>
|
|
<tr><td class="paramname">high</td><td>ending index </td></tr>
|
|
</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 < high) {</div>
|
|
<div class="line"><span class="lineno"> 89</span> <span class="keywordtype">int</span> p = <a class="code hl_function" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">partition</a>(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="aquick__sort_8cpp_html_a1b2a2cc2d319240f3b65c5b2f479ed82"><div class="ttname"><a href="#a1b2a2cc2d319240f3b65c5b2f479ed82">sorting::quick_sort::partition</a></div><div class="ttdeci">int partition(std::vector< T > *arr, const int &low, const int &high)</div><div class="ttdoc">Sorts the array taking the last element as pivot.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d21/quick__sort_8cpp_source.html#l00059">quick_sort.cpp:59</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a53adad7e4d83e1495df25fe8dbb4cc05" name="a53adad7e4d83e1495df25fe8dbb4cc05"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a53adad7e4d83e1495df25fe8dbb4cc05">◆ </a></span>quick_sort() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector< T > sorting::quick_sort::quick_sort </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< T ></td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>low</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>high</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>the main function that implements Quick Sort. </p>
|
|
<p>T (array type) function which calls the void function. Can be used for self-tests and other functionalities. </p><dl class="tparams"><dt>Template Parameters</dt><dd>
|
|
<table class="tparams">
|
|
<tr><td class="paramname">T</td><td>array type </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">arr</td><td>array to be sorted </td></tr>
|
|
<tr><td class="paramname">low</td><td>starting index </td></tr>
|
|
<tr><td class="paramname">high</td><td>ending index </td></tr>
|
|
</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 < high) {</div>
|
|
<div class="line"><span class="lineno"> 109</span> <span class="keywordtype">int</span> p = <a class="code hl_function" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">partition</a>(&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>(&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>(&arr, p + 1, high);</div>
|
|
<div class="line"><span class="lineno"> 113</span> }</div>
|
|
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">return</span> arr;</div>
|
|
<div class="line"><span class="lineno"> 115</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="aeccefcf6fcca62c54939c5ec9a93109b" name="aeccefcf6fcca62c54939c5ec9a93109b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aeccefcf6fcca62c54939c5ec9a93109b">◆ </a></span>show()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void sorting::quick_sort::show </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< T > &</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const int &</td> <td class="paramname"><span class="paramname"><em>size</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Utility function to print the array contents. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">arr</td><td>the array to be printed </td></tr>
|
|
<tr><td class="paramname">size</td><td>size of the given array </td></tr>
|
|
</table>
|
|
</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 < size; i++) std::cout << arr[i] << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><span class="lineno"> 126</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 127</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void tests </td>
|
|
<td>(</td>
|
|
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<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> std::vector<uint64_t> arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
|
|
<div class="line"><span class="lineno"> 139</span> std::vector<uint64_t> 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(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));</div>
|
|
<div class="line"><span class="lineno"> 143</span> std::cout << <span class="stringliteral">"\n1st test: passed!\n"</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> std::vector<int64_t> 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> std::vector<int64_t> 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(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));</div>
|
|
<div class="line"><span class="lineno"> 152</span> std::cout << <span class="stringliteral">"2nd test: passed!\n"</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> std::vector<double> 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> std::vector<double> 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(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));</div>
|
|
<div class="line"><span class="lineno"> 161</span> std::cout << <span class="stringliteral">"3rd test: passed!\n"</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 = std::rand() % 750 + 100;</div>
|
|
<div class="line"><span class="lineno"> 165</span> </div>
|
|
<div class="line"><span class="lineno"> 166</span> std::vector<float> arr4(size);</div>
|
|
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < size; i++) {</div>
|
|
<div class="line"><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"><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"><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> std::vector<float> 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> std::cout << <span class="stringliteral">"4th test: passed!\n"</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> std::cout << <span class="stringliteral">"\n\tPrinting all sorted arrays:\t\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 181</span> </div>
|
|
<div class="line"><span class="lineno"> 182</span> std::cout << <span class="stringliteral">"1st array:\n"</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 << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 185</span> std::cout << <span class="stringliteral">"2nd array:\n"</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 << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 188</span> std::cout << <span class="stringliteral">"3rd array:\n"</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>(std::end(arr3) - std::begin(arr3)) - 1);</div>
|
|
<div class="line"><span class="lineno"> 191</span> std::cout << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 192</span> std::cout << <span class="stringliteral">"Start: 4th array:\n\n"</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>(std::end(arr4_sorted) - std::begin(arr4_sorted)) - 1);</div>
|
|
<div class="line"><span class="lineno"> 195</span> std::cout << <span class="stringliteral">"\nEnd: 4th array.\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 196</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../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.13.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|