<html>
<head>
<title>二分查找</title>
<script language="javascript" type="text/javascript">
var arr=[1,4,6,8,9,90,800];
function binarySearch(arr,findVal,leftIndex,rightIndex)
{
if(leftIndex>rightIndex){
document.writeln("找不到!!!");
return;
}
var midIndex=Math.floor((leftIndex+rightIndex)/2);
var midVal=arr[midIndex];
if(midVal>findVal){
binarySearch(arr,findVal,leftIndex,midIndex-1);
}else if(midVal<findVal){
binarySearch(arr,findVal,midIndex+1,rightIndex);
}else{
document.writeln("找到了!下标是:"+midIndex);
return;
}
}
binarySearch(arr,2,0,arr.length-1);
</script>
</head>
<body></body>
</html>
用JavaScript实现二分查找(递归)
最新推荐文章于 2024-07-05 10:29:47 发布