backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity
Files
gh-pages
C-Plus-Plus/d9/d69/median__search_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

334 lines
24 KiB
HTML
Raw Permalink Blame History

<!-- 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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: search/median_search.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="../../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">&#160;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.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</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">
$(function(){initNavTree('d9/d69/median__search_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">median_search.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for median_search.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d2/d89/median__search_8cpp__incl.svg" width="351" 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="../../d9/d69/median__search_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:search" id="r_search"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
<tr class="memdesc:d9/dca/namespacesearch"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::assert <br /></td></tr>
<tr class="memitem:median_5Fsearch" id="r_median_5Fsearch"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/dd4/namespacemedian__search.html">median_search</a></td></tr>
<tr class="memdesc:da/dd4/namespacemedian__search"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Median_search" target="_blank">Median search</a> algorithm. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a868847218f694e78bf433a0ff7648bae" id="r_a868847218f694e78bf433a0ff7648bae"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a> (const std::vector&lt; int &gt; &amp;A, const int &amp;idx)</td></tr>
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> </p>
<p>Given an array A[1,...,n] of n numbers and an index i, where 1 ≤ i ≤ n, find the i-th smallest element of A. median_of_medians(A, i): #divide A into sublists of len 5 sublists = [A[j:j+5] for j in range(0, len(A), 5)] medians = [sorted(sublist)[len(sublist)/2] for sublist in sublists] if len(medians) &lt;= 5: pivot = sorted(medians)[len(medians)/2] else: #the pivot is the median of the medians pivot = median_of_medians(medians, len(medians)/2) #partitioning step low = [j for j in A if j &lt; pivot] high = [j for j in A if j &gt; pivot] k = len(low) if i &lt; k: return median_of_medians(low,i) elif i &gt; k: return median_of_medians(high,i-k-1) else: #pivot = k return pivot</p>
<dl class="section note"><dt>Note</dt><dd>this algorithm implements median search for only arrays which have distinct elements</dd></dl>
<p>Here are some example lists you can use to see how the algorithm works A = [1,2,3,4,5,1000,8,9,99] (Contain Unique Elements) B = [1,2,3,4,5,6] (Contains Unique Elements) print median_of_medians(A, 0) #should be 1 print median_of_medians(A,7) #should be 99 print median_of_medians(B,4) #should be 5</p>
<dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
<dd>
<a href="https://github.com/Rp-sushil" target="_blank">Sushil Kumar</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" 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>
<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>
<p class="definition">Definition at line <a class="el" href="../../d9/d69/median__search_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 129</span>{</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordtype">int</span> n = 0;</div>
<div class="line"><span class="lineno"> 132</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Size of Array: &quot;</span>;</div>
<div class="line"><span class="lineno"> 133</span> std::cin &gt;&gt; n;</div>
<div class="line"><span class="lineno"> 134</span> std::vector&lt;int&gt; a(n);</div>
<div class="line"><span class="lineno"> 135</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Array: &quot;</span>;</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; n; i++){</div>
<div class="line"><span class="lineno"> 137</span> std::cin &gt;&gt; a[i];</div>
<div class="line"><span class="lineno"> 138</span> }</div>
<div class="line"><span class="lineno"> 139</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Median: &quot;</span>; <span class="comment">// Median defination: https://en.wikipedia.org/wiki/Median</span></div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordtype">int</span> x = <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a, (n - 1) / 2);</div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span>(n % 2 == 0){</div>
<div class="line"><span class="lineno"> 142</span> <span class="keywordtype">int</span> y = <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a, n / 2);</div>
<div class="line"><span class="lineno"> 143</span> std::cout &lt;&lt; (float(x) + float(y))/2.0;</div>
<div class="line"><span class="lineno"> 144</span> }</div>
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">else</span>{</div>
<div class="line"><span class="lineno"> 146</span> std::cout &lt;&lt; x;</div>
<div class="line"><span class="lineno"> 147</span> }</div>
<div class="line"><span class="lineno"> 148</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nTo find i-th smallest element &quot;</span>;</div>
<div class="line"><span class="lineno"> 149</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter i: &quot;</span>;</div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordtype">int</span> idx = 0;</div>
<div class="line"><span class="lineno"> 151</span> std::cin &gt;&gt; idx;</div>
<div class="line"><span class="lineno"> 152</span> idx--;</div>
<div class="line"><span class="lineno"> 153</span> std::cout &lt;&lt; idx + 1&lt;&lt; <span class="stringliteral">&quot;-th smallest element: &quot;</span> &lt;&lt; <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a, idx) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><span class="lineno"> 154</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 155</span>}</div>
<div class="ttc" id="amedian__search_8cpp_html_a868847218f694e78bf433a0ff7648bae"><div class="ttname"><a href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a></div><div class="ttdeci">int median_of_medians(const std::vector&lt; int &gt; &amp;A, const int &amp;idx)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d69/median__search_8cpp_source.html#l00062">median_search.cpp:62</a></div></div>
<div class="ttc" id="amedian__search_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d69/median__search_8cpp_source.html#l00107">median_search.cpp:107</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a868847218f694e78bf433a0ff7648bae" name="a868847218f694e78bf433a0ff7648bae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a868847218f694e78bf433a0ff7648bae">&#9670;&#160;</a></span>median_of_medians()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int search::median_search::median_of_medians </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; int &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int &amp;</td> <td class="paramname"><span class="paramname"><em>idx</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>This function search the element in an array for the given index. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">A</td><td>array where numbers are saved </td></tr>
<tr><td class="paramname">idx</td><td>current index in array </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>corresponding element which we want to search. </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d9/d69/median__search_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">int</span> pivot = 0; <span class="comment">// initialized with zero</span></div>
<div class="line"><span class="lineno"> 64</span> std::vector&lt;int&gt; a(A.begin(), A.end());</div>
<div class="line"><span class="lineno"> 65</span> std::vector&lt;int&gt; m;</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordtype">int</span> r = a.size();</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; r; i += 5){</div>
<div class="line"><span class="lineno"> 68</span> std::sort(a.begin() + i, a.begin() + std::min(r, i + 5));</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordtype">int</span> mid = (i + std::min(r, i + 5)) / 2;</div>
<div class="line"><span class="lineno"> 70</span> m.push_back(a[mid]);</div>
<div class="line"><span class="lineno"> 71</span> }</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordtype">int</span> sz = int(m.size());</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">if</span>(sz &lt;= 5){</div>
<div class="line"><span class="lineno"> 74</span> std::sort(m.begin(), m.end());</div>
<div class="line"><span class="lineno"> 75</span> pivot = m[(sz- 1) / 2];</div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">else</span>{</div>
<div class="line"><span class="lineno"> 78</span> pivot = median_of_medians(m, idx);</div>
<div class="line"><span class="lineno"> 79</span> }</div>
<div class="line"><span class="lineno"> 80</span> std::vector&lt;int&gt; low;</div>
<div class="line"><span class="lineno"> 81</span> std::vector&lt;int&gt; high;</div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; r; i++){</div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span>(a[i] &lt; pivot){</div>
<div class="line"><span class="lineno"> 84</span> low.push_back(a[i]);</div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span>(a[i] &gt; pivot){</div>
<div class="line"><span class="lineno"> 87</span> high.push_back(a[i]);</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = int(low.size());</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span>(idx &lt; k){</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(low, idx);</div>
<div class="line"><span class="lineno"> 93</span> }</div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span>(idx &gt; k){</div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(high, idx-k-1);</div>
<div class="line"><span class="lineno"> 96</span> }</div>
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">else</span>{</div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">return</span> pivot;</div>
<div class="line"><span class="lineno"> 99</span> }</div>
<div class="line"><span class="lineno"> 100</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6d43b7002">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to test above algorithm </p>
<p class="definition">Definition at line <a class="el" href="../../d9/d69/median__search_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 107</span> {</div>
<div class="line"><span class="lineno"> 108</span> std::vector&lt;int&gt; A{25,21,98,100,76,22,43,60,89,87};</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordtype">int</span> i = 3;</div>
<div class="line"><span class="lineno"> 110</span> assert(A[6] == <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(A, i)); <span class="comment">// A[6] = 43, is the fourth smallest element.</span></div>
<div class="line"><span class="lineno"> 111</span> std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 112</span> </div>
<div class="line"><span class="lineno"> 113</span> std::vector&lt;int&gt; B{1,2,3,4,5,6};</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordtype">int</span> j = 4;</div>
<div class="line"><span class="lineno"> 115</span> assert(B[4] == <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(B, j)); <span class="comment">// B[4] = 5, is the fifth smallest element.</span></div>
<div class="line"><span class="lineno"> 116</span> std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 117</span> </div>
<div class="line"><span class="lineno"> 118</span> std::vector&lt;int&gt; C{1,2,3,4,5,1000,8,9,99};</div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 3;</div>
<div class="line"><span class="lineno"> 120</span> assert(C[3] == <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(C, k)); <span class="comment">// C[3] = 4, is the fourth smallest element.</span></div>
<div class="line"><span class="lineno"> 121</span> std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 122</span> std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 123</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a href="../../d9/d69/median__search_8cpp.html">median_search.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.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink