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
766630cc7008aec2e1ab31ed2c956bbdac6bdce0
C-Plus-Plus/de/d0d/fibonacci__search_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

360 lines
24 KiB
HTML
Raw 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/fibonacci_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('de/d0d/fibonacci__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">fibonacci_search.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cstdlib&gt;</code><br />
<code>#include &lt;algorithm&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for fibonacci_search.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d9/dfa/fibonacci__search_8cpp__incl.svg" width="434" 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="../../de/d0d/fibonacci__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-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a0bc61b3903d9a53061bf31e5d110fe61" id="r_a0bc61b3903d9a53061bf31e5d110fe61"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a> (const std::vector&lt; int &gt; &amp;arr, int value)</td></tr>
<tr class="memdesc:a0bc61b3903d9a53061bf31e5d110fe61"><td class="mdescLeft">&#160;</td><td class="mdescRight">using fibonacci search algorithm finds an index of a given element in a sorted array <br /></td></tr>
<tr class="memitem:a5e144326104e57a3808aed7eb098db0d" id="r_a5e144326104e57a3808aed7eb098db0d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a> ()</td></tr>
<tr class="memdesc:a5e144326104e57a3808aed7eb098db0d"><td class="mdescLeft">&#160;</td><td class="mdescRight">random tests for checking performance when an array doesn't contain an element <br /></td></tr>
<tr class="memitem:a2aa09bef74ee063c1331de0883af4f4f" id="r_a2aa09bef74ee063c1331de0883af4f4f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a> ()</td></tr>
<tr class="memdesc:a2aa09bef74ee063c1331de0883af4f4f"><td class="mdescLeft">&#160;</td><td class="mdescRight">random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for <br /></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><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> </p>
<dl class="section author"><dt>Author</dt><dd>sprintyaf </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_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="a0bc61b3903d9a53061bf31e5d110fe61" name="a0bc61b3903d9a53061bf31e5d110fe61"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0bc61b3903d9a53061bf31e5d110fe61">&#9670;&#160;</a></span>fibonacci_search()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int fibonacci_search </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; int &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>value</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>using fibonacci search algorithm finds an index of a given element in a sorted array </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">arr</td><td>sorted array </td></tr>
<tr><td class="paramname">value</td><td>value that we're looking for </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>if the array contains the value, returns an index of the element. otherwise -1. </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 23</span> {</div>
<div class="line"><span class="lineno"> 24</span> <span class="comment">// initialize last and current members of Fibonacci sequence </span></div>
<div class="line"><span class="lineno"> 25</span> <span class="keywordtype">int</span> last = 0, current = 1;</div>
<div class="line"><span class="lineno"> 26</span> <span class="keywordtype">int</span> length = arr.size(); <span class="comment">// array size</span></div>
<div class="line"><span class="lineno"> 27</span> <span class="comment">// next member of Fibonacci sequence which is &quot;last&quot; + &quot;current&quot;</span></div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordtype">int</span> next = last + current; </div>
<div class="line"><span class="lineno"> 29</span> </div>
<div class="line"><span class="lineno"> 30</span> <span class="comment">// &quot;next&quot; will store the smallest Fibonacci number greater or equal to &quot;length&quot;</span></div>
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">while</span>(next &lt; length){</div>
<div class="line"><span class="lineno"> 32</span> last = current;</div>
<div class="line"><span class="lineno"> 33</span> current = next;</div>
<div class="line"><span class="lineno"> 34</span> next = last + current;</div>
<div class="line"><span class="lineno"> 35</span> }</div>
<div class="line"><span class="lineno"> 36</span> </div>
<div class="line"><span class="lineno"> 37</span> <span class="comment">// &quot;offset&quot; is the end of eliminated range from front</span></div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordtype">int</span> offset = -1, index;</div>
<div class="line"><span class="lineno"> 39</span> <span class="comment">// while loop until there are elements left to consider.</span></div>
<div class="line"><span class="lineno"> 40</span> <span class="comment">// when &quot;next&quot; becomes 1, last is equal to 0, so search is done,</span></div>
<div class="line"><span class="lineno"> 41</span> <span class="comment">// because arr[offset] will already be eliminated</span></div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">while</span>(next &gt; 1){</div>
<div class="line"><span class="lineno"> 43</span> <span class="comment">// check if &quot;last&quot; is valid location</span></div>
<div class="line"><span class="lineno"> 44</span> index = std::min(offset + last, length-1);</div>
<div class="line"><span class="lineno"> 45</span> <span class="comment">// if value is greater than the value at &quot;index&quot;, eliminate the subarray from offset to index</span></div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span>(arr[index] &lt; value){</div>
<div class="line"><span class="lineno"> 47</span> next = current;</div>
<div class="line"><span class="lineno"> 48</span> current = last;</div>
<div class="line"><span class="lineno"> 49</span> last = next - current;</div>
<div class="line"><span class="lineno"> 50</span> offset = index;</div>
<div class="line"><span class="lineno"> 51</span> <span class="comment">// if value is less than the value at &quot;index&quot;, eliminate the subarray after index+1</span></div>
<div class="line"><span class="lineno"> 52</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(arr[index] &gt; value){</div>
<div class="line"><span class="lineno"> 53</span> next = last;</div>
<div class="line"><span class="lineno"> 54</span> current = current - last;</div>
<div class="line"><span class="lineno"> 55</span> last = next - current;</div>
<div class="line"><span class="lineno"> 56</span> <span class="comment">// element is found</span></div>
<div class="line"><span class="lineno"> 57</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">return</span> index;</div>
<div class="line"><span class="lineno"> 59</span> }</div>
<div class="line"><span class="lineno"> 60</span> }</div>
<div class="line"><span class="lineno"> 61</span> <span class="comment">// comparing the last element</span></div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span>(current &amp;&amp; !arr.empty() &amp;&amp; arr[offset+1] == value){</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> offset+1;</div>
<div class="line"><span class="lineno"> 64</span> }</div>
<div class="line"><span class="lineno"> 65</span> <span class="comment">// value was not found, return -1</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 67</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 testing the algorithm </p>
<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 123</span> {</div>
<div class="line"><span class="lineno"> 124</span> assert(<a class="code hl_function" href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a>());</div>
<div class="line"><span class="lineno"> 125</span> assert(<a class="code hl_function" href="#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a>());</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 127</span>}</div>
<div class="ttc" id="afibonacci__search_8cpp_html_a2aa09bef74ee063c1331de0883af4f4f"><div class="ttname"><a href="#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a></div><div class="ttdeci">bool random_tests()</div><div class="ttdoc">random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki...</div><div class="ttdef"><b>Definition</b> <a href="../../de/d0d/fibonacci__search_8cpp_source.html#l00096">fibonacci_search.cpp:96</a></div></div>
<div class="ttc" id="afibonacci__search_8cpp_html_a5e144326104e57a3808aed7eb098db0d"><div class="ttname"><a href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a></div><div class="ttdeci">bool no_occurence_tests()</div><div class="ttdoc">random tests for checking performance when an array doesn&#39;t contain an element</div><div class="ttdef"><b>Definition</b> <a href="../../de/d0d/fibonacci__search_8cpp_source.html#l00072">fibonacci_search.cpp:72</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a5e144326104e57a3808aed7eb098db0d" name="a5e144326104e57a3808aed7eb098db0d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5e144326104e57a3808aed7eb098db0d">&#9670;&#160;</a></span>no_occurence_tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool no_occurence_tests </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>random tests for checking performance when an array doesn't contain an element </p>
<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 72</span> {</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordtype">bool</span> passed = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordtype">int</span> rand_num, rand_value, index, num_tests = 1000;</div>
<div class="line"><span class="lineno"> 75</span> std::vector&lt;int&gt; arr;</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">while</span>(num_tests--){</div>
<div class="line"><span class="lineno"> 77</span> arr.clear();</div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; 100; i++){</div>
<div class="line"><span class="lineno"> 79</span> rand_num = std::rand() % 1000;</div>
<div class="line"><span class="lineno"> 80</span> arr.push_back(rand_num);</div>
<div class="line"><span class="lineno"> 81</span> }</div>
<div class="line"><span class="lineno"> 82</span> rand_value = std::rand() % 1000;</div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">while</span>(std::find(arr.begin(), arr.end(), rand_value) != arr.end()){</div>
<div class="line"><span class="lineno"> 84</span> std::remove(arr.begin(), arr.end(), rand_value);</div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="line"><span class="lineno"> 86</span> sort(arr.begin(), arr.end());</div>
<div class="line"><span class="lineno"> 87</span> index = <a class="code hl_function" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(arr, rand_value);</div>
<div class="line"><span class="lineno"> 88</span> passed = passed &amp;&amp; (index == -1);</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> passed;</div>
<div class="line"><span class="lineno"> 91</span>}</div>
<div class="ttc" id="afibonacci__search_8cpp_html_a0bc61b3903d9a53061bf31e5d110fe61"><div class="ttname"><a href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a></div><div class="ttdeci">int fibonacci_search(const std::vector&lt; int &gt; &amp;arr, int value)</div><div class="ttdoc">using fibonacci search algorithm finds an index of a given element in a sorted array</div><div class="ttdef"><b>Definition</b> <a href="../../de/d0d/fibonacci__search_8cpp_source.html#l00023">fibonacci_search.cpp:23</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a2aa09bef74ee063c1331de0883af4f4f" name="a2aa09bef74ee063c1331de0883af4f4f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2aa09bef74ee063c1331de0883af4f4f">&#9670;&#160;</a></span>random_tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool random_tests </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for </p>
<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 96</span> {</div>
<div class="line"><span class="lineno"> 97</span> <span class="keywordtype">bool</span> passed = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordtype">int</span> rand_num, rand_value, index, real_value, num_tests = 10000;</div>
<div class="line"><span class="lineno"> 99</span> std::vector&lt;int&gt; arr;</div>
<div class="line"><span class="lineno"> 100</span> <span class="keywordflow">while</span>(num_tests--){</div>
<div class="line"><span class="lineno"> 101</span> arr.clear();</div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; 100; i++){</div>
<div class="line"><span class="lineno"> 103</span> rand_num = std::rand() % 1000;</div>
<div class="line"><span class="lineno"> 104</span> arr.push_back(rand_num);</div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="line"><span class="lineno"> 106</span> rand_value = std::rand() % 1000;</div>
<div class="line"><span class="lineno"> 107</span> std::sort(arr.begin(), arr.end());</div>
<div class="line"><span class="lineno"> 108</span> index = <a class="code hl_function" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(arr, rand_value);</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">if</span>(index != -1){</div>
<div class="line"><span class="lineno"> 110</span> real_value = arr[index];</div>
<div class="line"><span class="lineno"> 111</span> passed = passed &amp;&amp; (real_value == rand_value);</div>
<div class="line"><span class="lineno"> 112</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 113</span> passed = passed &amp;&amp; (std::find(arr.begin(), arr.end(), rand_value) == arr.end());</div>
<div class="line"><span class="lineno"> 114</span> }</div>
<div class="line"><span class="lineno"> 115</span> }</div>
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">return</span> passed;</div>
<div class="line"><span class="lineno"> 117</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="../../de/d0d/fibonacci__search_8cpp.html">fibonacci_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