mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-01 05:53:30 +08:00
Documentation for 1645cf281f
This commit is contained in:
github-actions
@@ -105,8 +105,8 @@ $(document).ready(function(){initNavTree('d9/d02/linear__search_8cpp.html','../.
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a>
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for linear_search.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -117,7 +117,7 @@ Include dependency graph for linear_search.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a84ac3988a534eb60ca351ed6caf56d84"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a> (int *array, int size, int key)</td></tr>
|
||||
<tr class="memdesc:a84ac3988a534eb60ca351ed6caf56d84"><td class="mdescLeft"> </td><td class="mdescRight">for assert <a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">More...</a><br /></td></tr>
|
||||
<tr class="memdesc:a84ac3988a534eb60ca351ed6caf56d84"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">More...</a><br /></td></tr>
|
||||
<tr class="separator:a84ac3988a534eb60ca351ed6caf56d84"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
||||
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <a href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">More...</a><br /></td></tr>
|
||||
@@ -164,8 +164,8 @@ Functions</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>for assert </p>
|
||||
<p >for IO operations</p>
|
||||
<p>for IO operations </p>
|
||||
<p >for assert</p>
|
||||
<p >[Algorithm implementation for linear search] </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramdir">[in]</td><td class="paramname">array</td><td>array to search in </td></tr>
|
||||
@@ -177,18 +177,17 @@ Functions</h2></td></tr>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index where the key-value occurs in the array </dd>
|
||||
<dd>
|
||||
-1 if key-value not found </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 22</span>{</div>
|
||||
<div class="line"><span class="lineno"> 23</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i)</div>
|
||||
<div class="line"><span class="lineno"> 24</span> {</div>
|
||||
<div class="line"><span class="lineno"> 25</span> <span class="keywordflow">if</span> (array[i] == key)</div>
|
||||
<div class="line"><span class="lineno"> 26</span> {</div>
|
||||
<div class="line"><span class="lineno"> 27</span> <span class="keywordflow">return</span> i;</div>
|
||||
<div class="line"><span class="lineno"> 28</span> }</div>
|
||||
<div class="line"><span class="lineno"> 29</span> }</div>
|
||||
<div class="line"><span class="lineno"> 30</span> </div>
|
||||
<div class="line"><span class="lineno"> 31</span> <span class="comment">/* We reach here only in case element is not present in array, return an invalid entry in that case*/</span></div>
|
||||
<div class="line"><span class="lineno"> 32</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><span class="lineno"> 33</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 21</span> {</div>
|
||||
<div class="line"><span class="lineno"> 22</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 23</span> <span class="keywordflow">if</span> (array[i] == key) {</div>
|
||||
<div class="line"><span class="lineno"> 24</span> <span class="keywordflow">return</span> i;</div>
|
||||
<div class="line"><span class="lineno"> 25</span> }</div>
|
||||
<div class="line"><span class="lineno"> 26</span> }</div>
|
||||
<div class="line"><span class="lineno"> 27</span> </div>
|
||||
<div class="line"><span class="lineno"> 28</span> <span class="comment">/* We reach here only in case element is not present in array, return an</span></div>
|
||||
<div class="line"><span class="lineno"> 29</span><span class="comment"> * invalid entry in that case*/</span></div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><span class="lineno"> 31</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -210,59 +209,52 @@ Functions</h2></td></tr>
|
||||
|
||||
<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"> 71</span>{</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordtype">int</span> mode = 0;</div>
|
||||
<div class="line"><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Choose mode\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Self-test mode (1), interactive mode (2): "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> </div>
|
||||
<div class="line"><span class="lineno"> 77</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> mode;</div>
|
||||
<div class="line"><span class="lineno"> 78</span> </div>
|
||||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">if</span> (mode == 2)</div>
|
||||
<div class="line"><span class="lineno"> 80</span> {</div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">int</span> size = 0;</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nEnter the size of the array [in range 1-30 ]: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> size;</div>
|
||||
<div class="line"><span class="lineno"> 84</span> </div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">while</span> (size <= 0 || size > 30){</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Size can only be 1-30. Please choose another value: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 87</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> size;</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> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordtype">int</span> key = 0;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> </div>
|
||||
<div class="line"><span class="lineno"> 93</span> <span class="comment">// Input for the array elements</span></div>
|
||||
<div class="line"><span class="lineno"> 94</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the array of "</span> << size << <span class="stringliteral">" numbers: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++)</div>
|
||||
<div class="line"><span class="lineno"> 96</span> {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> array[i];</div>
|
||||
<div class="line"><span class="lineno"> 98</span> }</div>
|
||||
<div class="line"><span class="lineno"> 99</span> </div>
|
||||
<div class="line"><span class="lineno"> 100</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nEnter the number to be searched: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> key;</div>
|
||||
<div class="line"><span class="lineno"> 102</span> </div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, key);</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">if</span> (index != -1)</div>
|
||||
<div class="line"><span class="lineno"> 105</span> {</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Number found at index: "</span> << index << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 107</span> }</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">else</span></div>
|
||||
<div class="line"><span class="lineno"> 109</span> {</div>
|
||||
<div class="line"><span class="lineno"> 110</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Array element not found"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 111</span> }</div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="keyword">delete</span>[] array;</div>
|
||||
<div class="line"><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">else</span></div>
|
||||
<div class="line"><span class="lineno"> 115</span> {</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 117</span> }</div>
|
||||
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 119</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 65</span> {</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordtype">int</span> mode = 0;</div>
|
||||
<div class="line"><span class="lineno"> 67</span> </div>
|
||||
<div class="line"><span class="lineno"> 68</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Choose mode\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Self-test mode (1), interactive mode (2): "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 70</span> </div>
|
||||
<div class="line"><span class="lineno"> 71</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> mode;</div>
|
||||
<div class="line"><span class="lineno"> 72</span> </div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">if</span> (mode == 2) {</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="keywordtype">int</span> size = 0;</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nEnter the size of the array [in range 1-30 ]: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> size;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> </div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">while</span> (size <= 0 || size > 30) {</div>
|
||||
<div class="line"><span class="lineno"> 79</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Size can only be 1-30. Please choose another value: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> size;</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> <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="keywordtype">int</span> key = 0;</div>
|
||||
<div class="line"><span class="lineno"> 85</span> </div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="comment">// Input for the array elements</span></div>
|
||||
<div class="line"><span class="lineno"> 87</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the array of "</span> << size << <span class="stringliteral">" numbers: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> array[i];</div>
|
||||
<div class="line"><span class="lineno"> 90</span> }</div>
|
||||
<div class="line"><span class="lineno"> 91</span> </div>
|
||||
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nEnter the number to be searched: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> key;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> </div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, key);</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">if</span> (index != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Number found at index: "</span> << index << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 98</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Array element not found"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 100</span> }</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="keyword">delete</span>[] array;</div>
|
||||
<div class="line"><span class="lineno"> 102</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 103</span> <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 104</span> }</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 106</span>}</div>
|
||||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="alinear__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:39</div></div>
|
||||
<div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:21</div></div>
|
||||
<div class="ttc" id="alinear__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:37</div></div>
|
||||
<div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:21</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -297,31 +289,29 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<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"> 40</span>{</div>
|
||||
<div class="line"><span class="lineno"> 41</span> <span class="keywordtype">int</span> size = 4;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++)</div>
|
||||
<div class="line"><span class="lineno"> 44</span> {</div>
|
||||
<div class="line"><span class="lineno"> 45</span> array[i] = i;</div>
|
||||
<div class="line"><span class="lineno"> 46</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 37</span> {</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordtype">int</span> size = 4;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 41</span> array[i] = i;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> </div>
|
||||
<div class="line"><span class="lineno"> 44</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 0) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 45</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 46</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 2) == 2);</div>
|
||||
<div class="line"><span class="lineno"> 47</span> </div>
|
||||
<div class="line"><span class="lineno"> 48</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 0) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 49</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 50</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 2) == 2);</div>
|
||||
<div class="line"><span class="lineno"> 51</span> </div>
|
||||
<div class="line"><span class="lineno"> 52</span> size = 6;</div>
|
||||
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++)</div>
|
||||
<div class="line"><span class="lineno"> 54</span> {</div>
|
||||
<div class="line"><span class="lineno"> 55</span> array[i] = i;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> }</div>
|
||||
<div class="line"><span class="lineno"> 57</span> </div>
|
||||
<div class="line"><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 3) == 3);</div>
|
||||
<div class="line"><span class="lineno"> 59</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 5) == 5);</div>
|
||||
<div class="line"><span class="lineno"> 61</span> </div>
|
||||
<div class="line"><span class="lineno"> 62</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests have successfully passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keyword">delete</span>[] array; <span class="comment">// free memory up</span></div>
|
||||
<div class="line"><span class="lineno"> 64</span>}</div>
|
||||
<div class="line"><span class="lineno"> 48</span> size = 6;</div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 50</span> array[i] = i;</div>
|
||||
<div class="line"><span class="lineno"> 51</span> }</div>
|
||||
<div class="line"><span class="lineno"> 52</span> </div>
|
||||
<div class="line"><span class="lineno"> 53</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 3) == 3);</div>
|
||||
<div class="line"><span class="lineno"> 54</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 55</span> assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 5) == 5);</div>
|
||||
<div class="line"><span class="lineno"> 56</span> </div>
|
||||
<div class="line"><span class="lineno"> 57</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests have successfully passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keyword">delete</span>[] array; <span class="comment">// free memory up</span></div>
|
||||
<div class="line"><span class="lineno"> 59</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
<map id="tests" name="tests">
|
||||
<area shape="rect" id="node1" title="Self-test implementations." alt="" coords="5,5,56,31"/>
|
||||
<area shape="rect" id="node2" href="$d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" title="for assert" alt="" coords="104,5,203,31"/>
|
||||
<area shape="rect" id="node2" href="$d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" title="for IO operations" alt="" coords="104,5,203,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
8e167eb7ed51cca6a14983245e3243f0
|
||||
7c0362a48f00d4a688d2e0de27ba7644
|
||||
@@ -20,7 +20,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for assert">
|
||||
<g id="a_node2"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for IO operations">
|
||||
<polygon fill="white" stroke="#666666" points="148,-19 74,-19 74,0 148,0 148,-19"/>
|
||||
<text text-anchor="middle" x="111" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">LinearSearch</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.5 KiB After Width: | Height: | Size: 1.5 KiB |
@@ -1,5 +1,5 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,5,56,31"/>
|
||||
<area shape="rect" id="node2" href="$d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" title="for assert" alt="" coords="203,5,301,31"/>
|
||||
<area shape="rect" id="node2" href="$d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" title="for IO operations" alt="" coords="203,5,301,31"/>
|
||||
<area shape="rect" id="node3" href="$d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self-test implementations." alt="" coords="104,31,155,56"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
edc4f4310f479483b258ffeee895f81d
|
||||
c1b2a027f30fe0899c9b31934d074824
|
||||
@@ -20,7 +20,7 @@
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for assert">
|
||||
<g id="a_node2"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for IO operations">
|
||||
<polygon fill="white" stroke="#666666" points="222,-38 148,-38 148,-19 222,-19 222,-38"/>
|
||||
<text text-anchor="middle" x="185" y="-26" font-family="Helvetica,sans-Serif" font-size="10.00">LinearSearch</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.5 KiB After Width: | Height: | Size: 2.5 KiB |
5
d9/d73/median__search2_8cpp__incl.map
Normal file
5
d9/d73/median__search2_8cpp__incl.map
Normal file
@@ -0,0 +1,5 @@
|
||||
<map id="search/median_search2.cpp" name="search/median_search2.cpp">
|
||||
<area shape="rect" id="node1" title="Given a linked list L[0,....,n] of n numbers, find the middle node." alt="" coords="5,5,191,31"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="19,79,84,104"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="109,79,181,104"/>
|
||||
</map>
|
||||
1
d9/d73/median__search2_8cpp__incl.md5
Normal file
1
d9/d73/median__search2_8cpp__incl.md5
Normal file
@@ -0,0 +1 @@
|
||||
3b2aa67abc4a7a6dbc0ec06089a024a2
|
||||
51
d9/d73/median__search2_8cpp__incl.svg
Normal file
51
d9/d73/median__search2_8cpp__incl.svg
Normal file
@@ -0,0 +1,51 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 6.0.1 (20220911.1526)
|
||||
-->
|
||||
<!-- Title: search/median_search2.cpp Pages: 1 -->
|
||||
<svg width="147pt" height="82pt"
|
||||
viewBox="0.00 0.00 147.00 82.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78)">
|
||||
<title>search/median_search2.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Given a linked list L[0,....,n] of n numbers, find the middle node.">
|
||||
<polygon fill="#999999" stroke="#666666" points="139,-74 0,-74 0,-55 139,-55 139,-74"/>
|
||||
<text text-anchor="middle" x="69.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">search/median_search2.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="59,-19 10,-19 10,0 59,0 59,-19"/>
|
||||
<text text-anchor="middle" x="34.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M63.72,-54.75C58.88,-47.42 51.82,-36.73 45.86,-27.7"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="48.6,-25.5 40.17,-19.09 42.76,-29.36 48.6,-25.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="131.5,-19 77.5,-19 77.5,0 131.5,0 131.5,-19"/>
|
||||
<text text-anchor="middle" x="104.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M75.28,-54.75C80.12,-47.42 87.18,-36.73 93.14,-27.7"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.24,-29.36 98.83,-19.09 90.4,-25.5 96.24,-29.36"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.1 KiB |
Reference in New Issue
Block a user