87,921
社区成员
发帖
与我相关
我的任务
分享
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>冒泡排序</title>
<script type="text/javascript">
var arr1 = [5,2,8,0,1,8,12,29,10,38,22];
for(var i = 0; i < arr1.length - 1; i++)
{
for(var j = 0; j < arr1.length - 1 - i; j++)
{
if(arr1[j] > arr1[j + 1])
{
var temp = arr1[j];
arr1[j] = arr1[j + 1];
arr1[j + 1] = temp;
}
}
}
/*二分查找*/
var mid;
function binarySearch(arr, num, i , j)
{
mid = Math.floor((i + j) / 2);
if(arr[mid] == num)
{
document.write("find it!" + mid + "<br />")
return mid;
}
else if(arr[mid] > num)
{
document.write(mid + ":" + arr[mid] + "<br>");
binarySearch(arr, num, i, mid);
}
else
{
document.write(mid + ":" + arr[mid] + "<br>");
binarySearch(arr, num, mid, j);
}
if(i > j)
{
return false;
}
}
var res = binarySearch(arr1, 5, 0, arr1.length);
alert(res);
</script>
</head>
<body>
</body>
</html>