2020-07-02 08:13:21 +08:00
<!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" >
< head >
< meta http-equiv = "Content-Type" content = "text/xhtml;charset=UTF-8" / >
< meta http-equiv = "X-UA-Compatible" content = "IE=9" / >
2020-08-27 00:14:44 +08:00
< meta name = "generator" content = "Doxygen 1.8.19" / >
2020-07-02 08:13:21 +08:00
< 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 style = "height: 56px;" >
< td id = "projectalign" style = "padding-left: 0.5em;" >
< div id = "projectname" > Algorithms_in_C
  < span id = "projectnumber" > 1.0.0< / span >
< / div >
< div id = "projectbrief" > Set of algorithms implemented in C.< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2020-08-27 00:14:44 +08:00
<!-- Generated by Doxygen 1.8.19 -->
2020-07-02 08:13:21 +08:00
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
$(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" >
< iframe src = "javascript:void(0)" frameborder = "0"
name="MSearchResults" id="MSearchResults">
< / iframe >
< / 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" > 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 < assert.h> < / code > < br / >
< code > #include < stdio.h> < / 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 = "186" height = "112" > < 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 name = "func-members" > < / a >
Functions< / h2 > < / td > < / tr >
< tr class = "memitem:a40855c608ca64048d04cff6526f0a582" > < td class = "memItemLeft" align = "right" valign = "top" > int  < / 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" >   < / td > < td class = "mdescRight" > Recursive implementation. < a href = "../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582" > More...< / a > < br / > < / td > < / tr >
< tr class = "separator:a40855c608ca64048d04cff6526f0a582" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
< tr class = "memitem:a908fd6d2ad0bba33f63f8454888a0032" > < td class = "memItemLeft" align = "right" valign = "top" > int  < / 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" >   < / td > < td class = "mdescRight" > Iterative implementation. < a href = "../../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032" > More...< / a > < br / > < / td > < / tr >
< tr class = "separator:a908fd6d2ad0bba33f63f8454888a0032" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
< tr class = "memitem:ae1a3968e7947464bee7714f6d43b7002" > < td class = "memItemLeft" align = "right" valign = "top" > < a id = "ae1a3968e7947464bee7714f6d43b7002" > < / a >
void  < / 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" >   < / td > < td class = "mdescRight" > Test implementations. < br / > < / td > < / tr >
< tr class = "separator:ae1a3968e7947464bee7714f6d43b7002" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
< tr class = "memitem:a840291bc02cba5474a4cb46a9b9566fe" > < td class = "memItemLeft" align = "right" valign = "top" > < a id = "a840291bc02cba5474a4cb46a9b9566fe" > < / a >
int  < / 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" >   < / td > < td class = "mdescRight" > Main function. < br / > < / td > < / tr >
< tr class = "separator:a840291bc02cba5474a4cb46a9b9566fe" > < td class = "memSeparator" colspan = "2" >   < / 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" > 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" > James McDermott< / a > - recursive algorithm < / dd >
< dd >
< a href = "https://github.com/kvedala" > Krishna Vedala< / a > - iterative algorithm < / dd > < / dl >
< / div > < h2 class = "groupheader" > Function Documentation< / h2 >
< a id = "a40855c608ca64048d04cff6526f0a582" > < / a >
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#a40855c608ca64048d04cff6526f0a582" > ◆ < / 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 *  < / td >
< td class = "paramname" > < em > arr< / em > , < / td >
< / tr >
< tr >
< td class = "paramkey" > < / td >
< td > < / td >
< td class = "paramtype" > int  < / td >
< td class = "paramname" > < em > l< / em > , < / td >
< / tr >
< tr >
< td class = "paramkey" > < / td >
< td > < / td >
< td class = "paramtype" > int  < / td >
< td class = "paramname" > < em > r< / em > , < / td >
< / tr >
< tr >
< td class = "paramkey" > < / td >
< td > < / td >
< td class = "paramtype" > int  < / td >
< td class = "paramname" > < em > x< / em >   < / 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" > < a name = "l00022" > < / a > < span class = "lineno" > 22< / span >   {< / div >
< div class = "line" > < a name = "l00023" > < / a > < span class = "lineno" > 23< / span >   < span class = "keywordflow" > if< / span > (r > = l)< / div >
< div class = "line" > < a name = "l00024" > < / a > < span class = "lineno" > 24< / span >   {< / div >
< div class = "line" > < a name = "l00025" > < / a > < span class = "lineno" > 25< / span >   < span class = "keywordtype" > int< / span > mid = l + (r - l) / 2;< / div >
< div class = "line" > < a name = "l00026" > < / a > < span class = "lineno" > 26< / span >   < / div >
< div class = "line" > < a name = "l00027" > < / a > < span class = "lineno" > 27< / span >   < span class = "comment" > // If element is present at middle< / span > < / div >
< div class = "line" > < a name = "l00028" > < / a > < span class = "lineno" > 28< / span >   < span class = "keywordflow" > if< / span > (arr[mid] == x)< / div >
< div class = "line" > < a name = "l00029" > < / a > < span class = "lineno" > 29< / span >   < span class = "keywordflow" > return< / span > mid;< / div >
< div class = "line" > < a name = "l00030" > < / a > < span class = "lineno" > 30< / span >   < / div >
< div class = "line" > < a name = "l00031" > < / a > < span class = "lineno" > 31< / span >   < span class = "comment" > // If element is smaller than middle< / span > < / div >
< div class = "line" > < a name = "l00032" > < / a > < span class = "lineno" > 32< / span >   < span class = "keywordflow" > if< / span > (arr[mid] > x)< / div >
< div class = "line" > < a name = "l00033" > < / a > < span class = "lineno" > 33< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582" > binarysearch1< / a > (arr, l, mid - 1, x);< / div >
< div class = "line" > < a name = "l00034" > < / a > < span class = "lineno" > 34< / span >   < / div >
< div class = "line" > < a name = "l00035" > < / a > < span class = "lineno" > 35< / span >   < span class = "comment" > // Else element is in right subarray< / span > < / div >
< div class = "line" > < a name = "l00036" > < / a > < span class = "lineno" > 36< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "../../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582" > binarysearch1< / a > (arr, mid + 1, r, x);< / div >
< div class = "line" > < a name = "l00037" > < / a > < span class = "lineno" > 37< / span >   }< / div >
< div class = "line" > < a name = "l00038" > < / a > < span class = "lineno" > 38< / span >   < / div >
< div class = "line" > < a name = "l00039" > < / a > < span class = "lineno" > 39< / span >   < span class = "comment" > // When element is not present in array< / span > < / div >
< div class = "line" > < a name = "l00040" > < / a > < span class = "lineno" > 40< / span >   < span class = "keywordflow" > return< / span > -1;< / div >
< div class = "line" > < a name = "l00041" > < / a > < span class = "lineno" > 41< / span >   }< / div >
< / div > <!-- fragment -->
< / div >
< / div >
< a id = "a908fd6d2ad0bba33f63f8454888a0032" > < / a >
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#a908fd6d2ad0bba33f63f8454888a0032" > ◆ < / 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 *  < / td >
< td class = "paramname" > < em > arr< / em > , < / td >
< / tr >
< tr >
< td class = "paramkey" > < / td >
< td > < / td >
< td class = "paramtype" > int  < / td >
< td class = "paramname" > < em > l< / em > , < / td >
< / tr >
< tr >
< td class = "paramkey" > < / td >
< td > < / td >
< td class = "paramtype" > int  < / td >
< td class = "paramname" > < em > r< / em > , < / td >
< / tr >
< tr >
< td class = "paramkey" > < / td >
< td > < / td >
< td class = "paramtype" > int  < / td >
< td class = "paramname" > < em > x< / em >   < / 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" > < a name = "l00052" > < / a > < span class = "lineno" > 52< / span >   {< / div >
< div class = "line" > < a name = "l00053" > < / a > < span class = "lineno" > 53< / span >   < span class = "keywordtype" > int< / span > mid = l + (r - l) / 2;< / div >
< div class = "line" > < a name = "l00054" > < / a > < span class = "lineno" > 54< / span >   < / div >
< div class = "line" > < a name = "l00055" > < / a > < span class = "lineno" > 55< / span >   < span class = "keywordflow" > while< / span > (arr[mid] != x)< / div >
< div class = "line" > < a name = "l00056" > < / a > < span class = "lineno" > 56< / span >   {< / div >
< div class = "line" > < a name = "l00057" > < / a > < span class = "lineno" > 57< / span >   < span class = "keywordflow" > if< / span > (r < = l || r < 0)< / div >
< div class = "line" > < a name = "l00058" > < / a > < span class = "lineno" > 58< / span >   < span class = "keywordflow" > return< / span > -1;< / div >
< div class = "line" > < a name = "l00059" > < / a > < span class = "lineno" > 59< / span >   < / div >
< div class = "line" > < a name = "l00060" > < / a > < span class = "lineno" > 60< / span >   < span class = "keywordflow" > if< / span > (arr[mid] > x)< / div >
< div class = "line" > < a name = "l00061" > < / a > < span class = "lineno" > 61< / span >   < span class = "comment" > // If element is smaller than middle< / span > < / div >
< div class = "line" > < a name = "l00062" > < / a > < span class = "lineno" > 62< / span >   r = mid - 1;< / div >
< div class = "line" > < a name = "l00063" > < / a > < span class = "lineno" > 63< / span >   < span class = "keywordflow" > else< / span > < / div >
< div class = "line" > < a name = "l00064" > < / a > < span class = "lineno" > 64< / span >   < span class = "comment" > // Else element is in right subarray< / span > < / div >
< div class = "line" > < a name = "l00065" > < / a > < span class = "lineno" > 65< / span >   l = mid + 1;< / div >
< div class = "line" > < a name = "l00066" > < / a > < span class = "lineno" > 66< / span >   < / div >
< div class = "line" > < a name = "l00067" > < / a > < span class = "lineno" > 67< / span >   mid = l + (r - l) / 2;< / div >
< div class = "line" > < a name = "l00068" > < / a > < span class = "lineno" > 68< / span >   }< / div >
< div class = "line" > < a name = "l00069" > < / a > < span class = "lineno" > 69< / span >   < / div >
< div class = "line" > < a name = "l00070" > < / a > < span class = "lineno" > 70< / span >   < span class = "comment" > // When element is not present in array< / span > < / div >
< div class = "line" > < a name = "l00071" > < / a > < span class = "lineno" > 71< / span >   < span class = "keywordflow" > return< / span > mid;< / div >
< div class = "line" > < a name = "l00072" > < / a > < span class = "lineno" > 72< / span >   }< / div >
< / div > <!-- fragment -->
< / div >
< / div >
< / div > <!-- contents -->
< / div > <!-- doc - content -->
< 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 >
<!-- 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 >
2020-08-27 00:14:44 +08:00
< li class = "footer" > Generated by < a href = "http://www.doxygen.org/index.html" > < img class = "footer" src = "../../doxygen.svg" width = "104" height = "31" alt = "doxygen" / > < / a > 1.8.19 < / li >
2020-07-02 08:13:21 +08:00
< / ul >
< / div >
< / body >
< / html >
