mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-12-03 18:52:54 +03:00
Code Issues Packages Projects Releases Wiki Activity
bb170bb1e4
TheAlgorithms-C/df/d3b/binary__search_8c.html
github-actions 478bb303a5 Documentation for 2b885108b8
2023-04-27 19:43:13 +00:00

390 lines
23 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.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: searching/binary_search.c 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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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.9.6 -->
<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" 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');
$(document).ready(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 */
$(document).ready(function(){initNavTree('df/d3b/binary__search_8c.html','../../'); initResizable(); });
/* @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="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">binary_search.c File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm" target="_blank">binary search</a> of a target value in a given <em>sorted</em> array.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;assert.h&gt;</code><br />
<code>#include &lt;stdio.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for binary_search.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d91/binary__search_8c__incl.svg" width="184" 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="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a40855c608ca64048d04cff6526f0a582"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a> (const int *arr, int l, int r, int x)</td></tr>
<tr class="memdesc:a40855c608ca64048d04cff6526f0a582"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive implementation. <br /></td></tr>
<tr class="separator:a40855c608ca64048d04cff6526f0a582"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a908fd6d2ad0bba33f63f8454888a0032"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a> (const int *arr, int l, int r, int x)</td></tr>
<tr class="memdesc:a908fd6d2ad0bba33f63f8454888a0032"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterative implementation. <br /></td></tr>
<tr class="separator:a908fd6d2ad0bba33f63f8454888a0032"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
<tr class="memdesc:ae1a3968e7947464bee7714f6d43b7002"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test implementations. <br /></td></tr>
<tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a> (void)</td></tr>
<tr class="memdesc:a840291bc02cba5474a4cb46a9b9566fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:a840291bc02cba5474a4cb46a9b9566fe"><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>Program to perform <a href="https://en.wikipedia.org/wiki/Binary_search_algorithm" target="_blank">binary search</a> of a target value in a given <em>sorted</em> array. </p>
<dl class="section author"><dt>Authors</dt><dd><a href="https://github.com/theycallmemac" target="_blank">James McDermott</a> - recursive algorithm </dd>
<dd>
<a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> - iterative algorithm </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a40855c608ca64048d04cff6526f0a582" name="a40855c608ca64048d04cff6526f0a582"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a40855c608ca64048d04cff6526f0a582">&#9670;&#160;</a></span>binarysearch1()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int binarysearch1 </td>
<td>(</td>
<td class="paramtype">const int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>r</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive implementation. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">arr</td><td>array to search </td></tr>
<tr><td class="paramdir"></td><td class="paramname">l</td><td>left index of search range </td></tr>
<tr><td class="paramdir"></td><td class="paramname">r</td><td>right index of search range </td></tr>
<tr><td class="paramdir"></td><td class="paramname">x</td><td>target value to search for </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>location of x assuming array arr[l..r] is present </dd>
<dd>
-1 otherwise </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">if</span> (r &gt;= l)</div>
<div class="line"><span class="lineno"> 24</span> {</div>
<div class="line"><span class="lineno"> 25</span> <span class="keywordtype">int</span> mid = l + (r - l) / 2;</div>
<div class="line"><span class="lineno"> 26</span> </div>
<div class="line"><span class="lineno"> 27</span> <span class="comment">// If element is present at middle</span></div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">if</span> (arr[mid] == x)</div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordflow">return</span> mid;</div>
<div class="line"><span class="lineno"> 30</span> </div>
<div class="line"><span class="lineno"> 31</span> <span class="comment">// If element is smaller than middle</span></div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordflow">if</span> (arr[mid] &gt; x)</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a>(arr, l, mid - 1, x);</div>
<div class="line"><span class="lineno"> 34</span> </div>
<div class="line"><span class="lineno"> 35</span> <span class="comment">// Else element is in right subarray</span></div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a>(arr, mid + 1, r, x);</div>
<div class="line"><span class="lineno"> 37</span> }</div>
<div class="line"><span class="lineno"> 38</span> </div>
<div class="line"><span class="lineno"> 39</span> <span class="comment">// When element is not present in array</span></div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 41</span>}</div>
<div class="ttc" id="abinary__search_8c_html_a40855c608ca64048d04cff6526f0a582"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a></div><div class="ttdeci">int binarysearch1(const int *arr, int l, int r, int x)</div><div class="ttdoc">Recursive implementation.</div><div class="ttdef"><b>Definition:</b> binary_search.c:21</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="../../df/d3b/binary__search_8c_a40855c608ca64048d04cff6526f0a582_cgraph.svg" width="114" height="60"><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="a908fd6d2ad0bba33f63f8454888a0032" name="a908fd6d2ad0bba33f63f8454888a0032"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a908fd6d2ad0bba33f63f8454888a0032">&#9670;&#160;</a></span>binarysearch2()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int binarysearch2 </td>
<td>(</td>
<td class="paramtype">const int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>r</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterative implementation. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">arr</td><td>array to search </td></tr>
<tr><td class="paramdir"></td><td class="paramname">l</td><td>left index of search range </td></tr>
<tr><td class="paramdir"></td><td class="paramname">r</td><td>right index of search range </td></tr>
<tr><td class="paramdir"></td><td class="paramname">x</td><td>target value to search for </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>location of x assuming array arr[l..r] is present </dd>
<dd>
-1 otherwise </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 52</span>{</div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordtype">int</span> mid = l + (r - l) / 2;</div>
<div class="line"><span class="lineno"> 54</span> </div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">while</span> (arr[mid] != x)</div>
<div class="line"><span class="lineno"> 56</span> {</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">if</span> (r &lt;= l || r &lt; 0)</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 59</span> </div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">if</span> (arr[mid] &gt; x)</div>
<div class="line"><span class="lineno"> 61</span> <span class="comment">// If element is smaller than middle</span></div>
<div class="line"><span class="lineno"> 62</span> r = mid - 1;</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 64</span> <span class="comment">// Else element is in right subarray</span></div>
<div class="line"><span class="lineno"> 65</span> l = mid + 1;</div>
<div class="line"><span class="lineno"> 66</span> </div>
<div class="line"><span class="lineno"> 67</span> mid = l + (r - l) / 2;</div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> </div>
<div class="line"><span class="lineno"> 70</span> <span class="comment">// When element is not present in array</span></div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">return</span> mid;</div>
<div class="line"><span class="lineno"> 72</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a840291bc02cba5474a4cb46a9b9566fe" name="a840291bc02cba5474a4cb46a9b9566fe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a840291bc02cba5474a4cb46a9b9566fe">&#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&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<div class="fragment"><div class="line"><span class="lineno"> 106</span>{</div>
<div class="line"><span class="lineno"> 107</span> <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 109</span>}</div>
<div class="ttc" id="abinary__search_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> binary_search.c:75</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="../../df/d3b/binary__search_8c_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg" width="302" height="110"><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="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="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Test implementations. </p>
<div class="fragment"><div class="line"><span class="lineno"> 76</span>{</div>
<div class="line"><span class="lineno"> 77</span> <span class="comment">// give function an array to work with</span></div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordtype">int</span> arr[] = {2, 3, 4, 10, 40};</div>
<div class="line"><span class="lineno"> 79</span> <span class="comment">// get size of array</span></div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
<div class="line"><span class="lineno"> 81</span> </div>
<div class="line"><span class="lineno"> 82</span> printf(<span class="stringliteral">&quot;Test 1.... &quot;</span>);</div>
<div class="line"><span class="lineno"> 83</span> <span class="comment">// set value to look for</span></div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordtype">int</span> x = 10;</div>
<div class="line"><span class="lineno"> 85</span> <span class="comment">// set result to what is returned from binarysearch</span></div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordtype">int</span> result = <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a>(arr, 0, n - 1, x);</div>
<div class="line"><span class="lineno"> 87</span> assert(result == 3);</div>
<div class="line"><span class="lineno"> 88</span> printf(<span class="stringliteral">&quot;passed recursive... &quot;</span>);</div>
<div class="line"><span class="lineno"> 89</span> result = <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a>(arr, 0, n - 1, x);</div>
<div class="line"><span class="lineno"> 90</span> assert(result == 3);</div>
<div class="line"><span class="lineno"> 91</span> printf(<span class="stringliteral">&quot;passed iterative...\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 92</span> </div>
<div class="line"><span class="lineno"> 93</span> printf(<span class="stringliteral">&quot;Test 2.... &quot;</span>);</div>
<div class="line"><span class="lineno"> 94</span> x = 5;</div>
<div class="line"><span class="lineno"> 95</span> <span class="comment">// set result to what is returned from binarysearch</span></div>
<div class="line"><span class="lineno"> 96</span> result = <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582">binarysearch1</a>(arr, 0, n - 1, x);</div>
<div class="line"><span class="lineno"> 97</span> assert(result == -1);</div>
<div class="line"><span class="lineno"> 98</span> printf(<span class="stringliteral">&quot;passed recursive... &quot;</span>);</div>
<div class="line"><span class="lineno"> 99</span> result = <a class="code hl_function" href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a>(arr, 0, n - 1, x);</div>
<div class="line"><span class="lineno"> 100</span> assert(result == -1);</div>
<div class="line"><span class="lineno"> 101</span> printf(<span class="stringliteral">&quot;passed iterative...\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 102</span>}</div>
<div class="ttc" id="abinary__search_8c_html_a908fd6d2ad0bba33f63f8454888a0032"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032">binarysearch2</a></div><div class="ttdeci">int binarysearch2(const int *arr, int l, int r, int x)</div><div class="ttdoc">Iterative implementation.</div><div class="ttdef"><b>Definition:</b> binary_search.c:51</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="../../df/d3b/binary__search_8c_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="204" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</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_da574daf9ce9c05b45556bdc871ed1e3.html">searching</a></li><li class="navelem"><a class="el" href="../../df/d3b/binary__search_8c.html">binary_search.c</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.9.6 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink