mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-23 13:22:47 +08:00
Documentation for da53b26bde
This commit is contained in:
realstealthninja
@@ -214,48 +214,48 @@ 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> 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>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00213">213</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"> 213</span> {</div>
|
||||
<div class="line"><span class="lineno"> 214</span> <span class="keywordtype">int</span> choice = 0;</div>
|
||||
<div class="line"><span class="lineno"> 215</span> </div>
|
||||
<div class="line"><span class="lineno"> 216</span> std::cout << <span class="stringliteral">"\tAvailable modes\t\n\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 217</span> std::cout << <span class="stringliteral">"1. Self-tests mode\n2. Interactive mode"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 218</span> </div>
|
||||
<div class="line"><span class="lineno"> 219</span> std::cout << <span class="stringliteral">"\nChoose a mode: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 220</span> std::cin >> choice;</div>
|
||||
<div class="line"><span class="lineno"> 221</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 222</span> </div>
|
||||
<div class="line"><span class="lineno"> 223</span> <span class="keywordflow">while</span> ((choice != 1) && (choice != 2)) {</div>
|
||||
<div class="line"><span class="lineno"> 224</span> std::cout << <span class="stringliteral">"Invalid option. Choose between the valid modes: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 225</span> std::cin >> choice;</div>
|
||||
<div class="line"><span class="lineno"> 226</span> }</div>
|
||||
<div class="line"><span class="lineno"> 227</span> </div>
|
||||
<div class="line"><span class="lineno"> 228</span> <span class="keywordflow">if</span> (choice == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 229</span> std::srand(std::time(<span class="keyword">nullptr</span>));</div>
|
||||
<div class="line"><span class="lineno"> 230</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"> 231</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
|
||||
<div class="line"><span class="lineno"> 232</span> <span class="keywordtype">int</span> size = 0;</div>
|
||||
<div class="line"><span class="lineno"> 233</span> std::cout << <span class="stringliteral">"\nEnter the number of elements: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 234</span> </div>
|
||||
<div class="line"><span class="lineno"> 235</span> std::cin >> size;</div>
|
||||
<div class="line"><span class="lineno"> 236</span> std::vector<float> arr(size);</div>
|
||||
<div class="line"><span class="lineno"> 237</span> </div>
|
||||
<div class="line"><span class="lineno"> 238</span> std::cout</div>
|
||||
<div class="line"><span class="lineno"> 239</span> << <span class="stringliteral">"\nEnter the unsorted elements (can be negative/decimal): "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 240</span> </div>
|
||||
<div class="line"><span class="lineno"> 241</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 242</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 243</span> std::cin >> arr[i];</div>
|
||||
<div class="line"><span class="lineno"> 244</span> }</div>
|
||||
<div class="line"><span class="lineno"> 245</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"> 246</span> std::cout << <span class="stringliteral">"\nSorted array: \n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr, size);</div>
|
||||
<div class="line"><span class="lineno"> 248</span> }</div>
|
||||
<div class="line"><span class="lineno"> 249</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 250</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#l00147">quick_sort.cpp:147</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#l00098">quick_sort.cpp:98</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#l00135">quick_sort.cpp:135</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -300,25 +300,32 @@ template<typename T> </div>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of the smaller element </dd></dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of the smaller element</dd></dl>
|
||||
<h3><a class="anchor" id="autotoc_md116"></a>
|
||||
Time Complexity</h3>
|
||||
<p>best case, average Case: O(nlog(n)) Worst Case: O(n^2) (Worst case occur when the partition is consistently unbalanced.)</p>
|
||||
<h3><a class="anchor" id="autotoc_md117"></a>
|
||||
Space Complexity</h3>
|
||||
<p>average Case: O(log(n)) Worst Case: O(n) <br />
|
||||
It's space complexity is due to the recursive function calls and partitioning process. </p>
|
||||
|
||||
<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>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00070">70</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"> 70</span> {</div>
|
||||
<div class="line"><span class="lineno"> 71</span> T pivot = (*arr)[high]; <span class="comment">// taking the last element as pivot</span></div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordtype">int</span> i = (low - 1); <span class="comment">// Index of smaller element</span></div>
|
||||
<div class="line"><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = low; j < high; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="comment">// If current element is smaller than or</span></div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="comment">// equal to pivot</span></div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">if</span> ((*arr)[j] <= pivot) {</div>
|
||||
<div class="line"><span class="lineno"> 78</span> i++; <span class="comment">// increment index of smaller element</span></div>
|
||||
<div class="line"><span class="lineno"> 79</span> std::swap((*arr)[i], (*arr)[j]);</div>
|
||||
<div class="line"><span class="lineno"> 80</span> }</div>
|
||||
<div class="line"><span class="lineno"> 81</span> }</div>
|
||||
<div class="line"><span class="lineno"> 82</span> </div>
|
||||
<div class="line"><span class="lineno"> 83</span> std::swap((*arr)[i + 1], (*arr)[high]);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">return</span> (i + 1);</div>
|
||||
<div class="line"><span class="lineno"> 85</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -364,17 +371,17 @@ template<typename T> </div>
|
||||
</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>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00098">98</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"> 98</span> {</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">if</span> (low < high) {</div>
|
||||
<div class="line"><span class="lineno"> 100</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"> 101</span> </div>
|
||||
<div class="line"><span class="lineno"> 102</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"> 103</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"> 104</span> }</div>
|
||||
<div class="line"><span class="lineno"> 105</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 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#l00070">quick_sort.cpp:70</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -420,16 +427,16 @@ template<typename T> </div>
|
||||
</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>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00118">118</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"> 118</span> {</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">if</span> (low < high) {</div>
|
||||
<div class="line"><span class="lineno"> 120</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"> 121</span> </div>
|
||||
<div class="line"><span class="lineno"> 122</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"> 123</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"> 124</span> }</div>
|
||||
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">return</span> arr;</div>
|
||||
<div class="line"><span class="lineno"> 126</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -464,11 +471,11 @@ template<typename T> </div>
|
||||
</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>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00135">135</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"> 135</span> {</div>
|
||||
<div class="line"><span class="lineno"> 136</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"> 137</span> std::cout << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 138</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -498,68 +505,68 @@ template<typename T> </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> 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>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00147">147</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"> 147</span> {</div>
|
||||
<div class="line"><span class="lineno"> 148</span> <span class="comment">// 1st test (normal numbers)</span></div>
|
||||
<div class="line"><span class="lineno"> 149</span> std::vector<uint64_t> arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
|
||||
<div class="line"><span class="lineno"> 150</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"> 151</span> arr, 0, <span class="keywordtype">int</span>(std::end(arr) - std::begin(arr)) - 1);</div>
|
||||
<div class="line"><span class="lineno"> 152</span> </div>
|
||||
<div class="line"><span class="lineno"> 153</span> assert(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));</div>
|
||||
<div class="line"><span class="lineno"> 154</span> std::cout << <span class="stringliteral">"\n1st test: passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 155</span> </div>
|
||||
<div class="line"><span class="lineno"> 156</span> <span class="comment">// 2nd test (normal and negative numbers)</span></div>
|
||||
<div class="line"><span class="lineno"> 157</span> std::vector<int64_t> arr2 = {9, 15, 28, 96, 500, -4, -58,</div>
|
||||
<div class="line"><span class="lineno"> 158</span> -977, -238, -800, -21, -53, -55};</div>
|
||||
<div class="line"><span class="lineno"> 159</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"> 160</span> arr2, 0, std::end(arr2) - std::begin(arr2));</div>
|
||||
<div class="line"><span class="lineno"> 161</span> </div>
|
||||
<div class="line"><span class="lineno"> 162</span> assert(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));</div>
|
||||
<div class="line"><span class="lineno"> 163</span> std::cout << <span class="stringliteral">"2nd test: passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 164</span> </div>
|
||||
<div class="line"><span class="lineno"> 165</span> <span class="comment">// 3rd test (decimal and normal numbers)</span></div>
|
||||
<div class="line"><span class="lineno"> 166</span> std::vector<double> arr3 = {29, 36, 1100, 0, 77, 1,</div>
|
||||
<div class="line"><span class="lineno"> 167</span> 6.7, 8.97, 1.74, 950.10, -329.65};</div>
|
||||
<div class="line"><span class="lineno"> 168</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"> 169</span> arr3, 0, <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
|
||||
<div class="line"><span class="lineno"> 170</span> </div>
|
||||
<div class="line"><span class="lineno"> 171</span> assert(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));</div>
|
||||
<div class="line"><span class="lineno"> 172</span> std::cout << <span class="stringliteral">"3rd test: passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 173</span> </div>
|
||||
<div class="line"><span class="lineno"> 174</span> <span class="comment">// 4th test (random decimal and negative numbers)</span></div>
|
||||
<div class="line"><span class="lineno"> 175</span> <span class="keywordtype">size_t</span> size = std::rand() % 750 + 100;</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 class="line"><span class="lineno"> 177</span> std::vector<float> arr4(size);</div>
|
||||
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 179</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"> 180</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"> 181</span> 250;</div>
|
||||
<div class="line"><span class="lineno"> 182</span> }</div>
|
||||
<div class="line"><span class="lineno"> 183</span> </div>
|
||||
<div class="line"><span class="lineno"> 184</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"> 185</span> arr4, 0, <span class="keywordtype">int</span>(std::end(arr4) - std::begin(arr4)) - 1);</div>
|
||||
<div class="line"><span class="lineno"> 186</span> assert(std::is_sorted(std::begin(arr4_sorted), std::end(arr4_sorted)));</div>
|
||||
<div class="line"><span class="lineno"> 187</span> </div>
|
||||
<div class="line"><span class="lineno"> 188</span> std::cout << <span class="stringliteral">"4th test: passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 189</span> </div>
|
||||
<div class="line"><span class="lineno"> 190</span> <span class="comment">// Printing all sorted arrays</span></div>
|
||||
<div class="line"><span class="lineno"> 191</span> std::cout << <span class="stringliteral">"\n\tPrinting all sorted arrays:\t\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 192</span> </div>
|
||||
<div class="line"><span class="lineno"> 193</span> std::cout << <span class="stringliteral">"1st array:\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 194</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"> 195</span> std::cout << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 196</span> std::cout << <span class="stringliteral">"2nd array:\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 197</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"> 198</span> std::cout << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 199</span> std::cout << <span class="stringliteral">"3rd array:\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 200</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted3,</div>
|
||||
<div class="line"><span class="lineno"> 201</span> <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
|
||||
<div class="line"><span class="lineno"> 202</span> std::cout << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 203</span> std::cout << <span class="stringliteral">"Start: 4th array:\n\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 204</span> <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(</div>
|
||||
<div class="line"><span class="lineno"> 205</span> arr4_sorted, <span class="keywordtype">int</span>(std::end(arr4_sorted) - std::begin(arr4_sorted)) - 1);</div>
|
||||
<div class="line"><span class="lineno"> 206</span> std::cout << <span class="stringliteral">"\nEnd: 4th array.\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 207</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user