<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>二分法找出目标元素在数组所在位置</title>
</head>
<script>
let arr = [10,11,12,13,14,15,16,17,18,19]
function searchNum(target){
let start = 0;//数组第一位的初始位置节点
let end = arr.length - 1//数组末尾的位置节点
while (start<=end) {
let middle = Math.floor((start+end)/2)//,数组的中间位置节点(需考虑有可能为小数的情况)
let element = arr[middle]
if(target===element){
return middle
}else if(target < element){
end = middle - 1
}else{
start= middle + 1
}
}
}
console.log(this.searchNum(18));
</script>
<body>
</body>
</html>
基础算法-二分法
最新推荐文章于 2024-07-19 15:45:46 发布