遞歸：

?

int?BinSearch(int?Array[],int?low,int?high,int?key/*要找的值*/)??
?{??
?????if?(low<=high)??
?????{??
?????????int?mid?=?(low+high)/2;??
?????????if(key?==?Array[mid])??
?????????????return?mid;??
?????????else?if(key<Array[mid])??
?????????????return?BinSearch(Array,low,mid-1,key);??
?????????else?if(key>Array[mid])??
?????????????return?BinSearch(Array,mid+1,high,key);??
?????}??
?????else??
?????????return?-1;
}

?

非遞歸：

?

int?BinSearch(int?Array[],int?SizeOfArray,int?key/*要找的值*/)??

{??
????int?low=0,high=SizeOfArray-1;??
????int?mid;??
????while?(low<=high)??
????{??
????????mid?=?(low+high)/2;??
????????if(key==Array[mid])??
????????????return?mid;??
????????if(key<Array[mid])??
????????????high=mid-1;??
????????if(key>Array[mid])??
????????????low=mid+1;??
????}??
????return?-1;??
}

?

轉載于:https://www.cnblogs.com/g0feng/archive/2012/05/15/2502106.html

總結

以上是生活随笔為你收集整理的二分查找的递归与非递归！的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。