backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity
Files
b98db53ab4ca1496ef01bbfaaff602efa09d0199
C-Plus-Plus/d8/dfa/median__search2_8cpp.html
realstealthninja 0f4f6ce798 Documentation for 9374b00319
2024-09-17 16:26:13 +00:00

349 lines
27 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: search/median_search2.cpp File Reference</title>
<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="../../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/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.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="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;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&amp;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&amp;dn=expat.txt MIT */
$(function(){initNavTree('d8/dfa/median__search2_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="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">median_search2.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Given a linked list L[0,....,n] of n numbers, find the middle node.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for median_search2.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d73/median__search2_8cpp__incl.svg" width="195" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <a href="../../d7/da4/struct_list_node.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
<tr class="memdesc:d9/dca/namespacesearch"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><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>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</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:a5fefe132a0c3ee780ebc703f37ebce6a" id="r_a5fefe132a0c3ee780ebc703f37ebce6a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a> (<a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *head)</td></tr>
<tr class="separator:a5fefe132a0c3ee780ebc703f37ebce6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a565d9d4b66467f966b4e4f8ea2a2ef09" id="r_a565d9d4b66467f966b4e4f8ea2a2ef09"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a565d9d4b66467f966b4e4f8ea2a2ef09">search::median_search2::deleteAll</a> (const <a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *const head)</td></tr>
<tr class="separator:a565d9d4b66467f966b4e4f8ea2a2ef09"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</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>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Given a linked list L[0,....,n] of n numbers, find the middle node. </p>
<p>The technique utilized in this implementation is the ["Floyd's
tortoise and
hare"](<a href="https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_and_hare">https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_and_hare</a>) approach. This technique uses two pointers that iterate through the list at different 'speeds' in order to solve problems. In this implementation, for every iteration the slow pointer advances one node while the fast pointer advances two nodes. The result of this is that since the fast pointer moves twice as fast as the slow pointer, when the fast pointer reaches the end of the list the slow pointer will be pointing to the middle node of the list.</p>
<p>Here are some example lists you can use to see how the algorithm works A = [1,2,3,4,5] B = [1,2,3,4,5,6] print median(A) #should be 39 print median(B) #should be 4</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/weiss-ben" target="_blank">Benjamin Weiss</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d69/median__search_8cpp.html" title="Implementation of Median search algorithm. @cases from here">median_search.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a565d9d4b66467f966b4e4f8ea2a2ef09" name="a565d9d4b66467f966b4e4f8ea2a2ef09"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a565d9d4b66467f966b4e4f8ea2a2ef09">&#9670;&#160;</a></span>deleteAll()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void search::median_search2::deleteAll </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *const</td> <td class="paramname"><span class="paramname"><em>head</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 77</span> {</div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">if</span> (head) {</div>
<div class="line"><span class="lineno"> 79</span> deleteAll(head-&gt;next);</div>
<div class="line"><span class="lineno"> 80</span> <span class="keyword">delete</span> head;</div>
<div class="line"><span class="lineno"> 81</span> }</div>
<div class="line"><span class="lineno"> 82</span>}</div>
</div><!-- fragment -->
</div>
</div>
<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>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
<div class="line"><span class="lineno"> 140</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 142</span>}</div>
<div class="ttc" id="amedian__search2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> median_search2.cpp:90</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a5fefe132a0c3ee780ebc703f37ebce6a" name="a5fefe132a0c3ee780ebc703f37ebce6a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5fefe132a0c3ee780ebc703f37ebce6a">&#9670;&#160;</a></span>middleNode()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> * search::median_search2::middleNode </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *</td> <td class="paramname"><span class="paramname"><em>head</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function searches for the median of a linked list. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">head</td><td>The head of the linked list. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Median node of the linked list. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">if</span> (!head) {</div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 62</span> }</div>
<div class="line"><span class="lineno"> 63</span> </div>
<div class="line"><span class="lineno"> 64</span> <span class="comment">// Fast and slow pointers</span></div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* fastptr = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* slowptr = fastptr = head;</div>
<div class="line"><span class="lineno"> 67</span> </div>
<div class="line"><span class="lineno"> 68</span> <span class="comment">// fast jumps 2 while slow jumps 1</span></div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">while</span> (fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> &amp;&amp; fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>) {</div>
<div class="line"><span class="lineno"> 70</span> slowptr = slowptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>;</div>
<div class="line"><span class="lineno"> 71</span> fastptr = fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>;</div>
<div class="line"><span class="lineno"> 72</span> }</div>
<div class="line"><span class="lineno"> 73</span> </div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">return</span> (fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>) ? slowptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> : slowptr;</div>
<div class="line"><span class="lineno"> 75</span>}</div>
<div class="ttc" id="astruct_list_node_html"><div class="ttname"><a href="../../d7/da4/struct_list_node.html">ListNode</a></div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> median_search2.cpp:31</div></div>
<div class="ttc" id="astruct_list_node_html_ad78b392c2ddc25c3243d0c2f30692fb1"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode::next</a></div><div class="ttdeci">ListNode * next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition</b> median_search2.cpp:33</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg" width="175" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </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</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>
<div class="fragment"><div class="line"><span class="lineno"> 90</span> {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keyword">auto</span>* head1 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
<div class="line"><span class="lineno"> 92</span> head1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = 1;</div>
<div class="line"><span class="lineno"> 93</span> </div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* temp = head1;</div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt; 6; ++i) {</div>
<div class="line"><span class="lineno"> 96</span> <span class="comment">// Allocate next</span></div>
<div class="line"><span class="lineno"> 97</span> <span class="keyword">auto</span>* temp1 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
<div class="line"><span class="lineno"> 98</span> temp1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = i;</div>
<div class="line"><span class="lineno"> 99</span> </div>
<div class="line"><span class="lineno"> 100</span> <span class="comment">// Advance</span></div>
<div class="line"><span class="lineno"> 101</span> temp-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = temp1;</div>
<div class="line"><span class="lineno"> 102</span> temp = temp1;</div>
<div class="line"><span class="lineno"> 103</span> }</div>
<div class="line"><span class="lineno"> 104</span> temp-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 105</span> </div>
<div class="line"><span class="lineno"> 106</span> <span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> median = <a class="code hl_function" href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a>(head1);</div>
<div class="line"><span class="lineno"> 107</span> assert(3 == median-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>); <span class="comment">// 3 is the value of the median node.</span></div>
<div class="line"><span class="lineno"> 108</span> search::median_search2::deleteAll(head1);</div>
<div class="line"><span class="lineno"> 109</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 110</span> </div>
<div class="line"><span class="lineno"> 111</span> <span class="comment">// Test case # 2</span></div>
<div class="line"><span class="lineno"> 112</span> <span class="keyword">auto</span>* head2 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
<div class="line"><span class="lineno"> 113</span> head2-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = 1;</div>
<div class="line"><span class="lineno"> 114</span> </div>
<div class="line"><span class="lineno"> 115</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* temp2 = head2;</div>
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt; 7; ++i) {</div>
<div class="line"><span class="lineno"> 117</span> <span class="comment">// Allocate next</span></div>
<div class="line"><span class="lineno"> 118</span> <span class="keyword">auto</span>* temp3 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
<div class="line"><span class="lineno"> 119</span> temp3-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = i;</div>
<div class="line"><span class="lineno"> 120</span> </div>
<div class="line"><span class="lineno"> 121</span> <span class="comment">// Advance</span></div>
<div class="line"><span class="lineno"> 122</span> temp2-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = temp3;</div>
<div class="line"><span class="lineno"> 123</span> temp2 = temp3;</div>
<div class="line"><span class="lineno"> 124</span> }</div>
<div class="line"><span class="lineno"> 125</span> temp2-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 126</span> </div>
<div class="line"><span class="lineno"> 127</span> <span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> median1 = <a class="code hl_function" href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a>(head2);</div>
<div class="line"><span class="lineno"> 128</span> assert(4 == median1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>); <span class="comment">// 4 is the value of the median node.</span></div>
<div class="line"><span class="lineno"> 129</span> search::median_search2::deleteAll(head2);</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 131</span> </div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 133</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="amedian__search2_8cpp_html_a5fefe132a0c3ee780ebc703f37ebce6a"><div class="ttname"><a href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a></div><div class="ttdeci">ListNode * middleNode(ListNode *head)</div><div class="ttdef"><b>Definition</b> median_search2.cpp:59</div></div>
<div class="ttc" id="astruct_list_node_html_a58389d1d1fc5430c2f4ce7c5d5dc48b3"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">ListNode::val</a></div><div class="ttdeci">int val</div><div class="ttdoc">the value stored in the node</div><div class="ttdef"><b>Definition</b> median_search2.cpp:32</div></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_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d8/dfa/median__search2_8cpp.html">median_search2.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink