<html>
<head>
<script language="javascript" type="text/javascript">
var arr=[0,1,5,6,8,11,50];
function binarySearch(arr,findVal,leftIndex,rightIndex){
if (leftIndex>rightIndex){
document.writeln("not find");
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("find index is "+midIndex);
return;
}
}
binarySearch(arr,3,0,arr.length-1);
binarySearch(arr,8,0,arr.length-1);
</script>
</head>
<body>
</body>
</html>
599
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
