二分查找

function binarySearch(item,arr)
{
	
	let low=0;
	let high=arr.length-1;
	let mid;
	while(low<=high)
	{
		mid=Math.floor((low+high)/2)
		if(item==arr[mid])
			return mid
		else if(arr[mid]>item)
			high=mid-1
		else
			low=mid+1
	}
	return "null"
	
}
var arr=[1,2,3,4,5,6,7,8,9]
console.log(binarySearch(8,arr));