js 几种查找算法

2019独角兽企业重金招聘Python工程师标准>>>

二分查找

// 二分查找
function halfSearch(arr,key){
	var max, min,mid;
	min = 0;
	max = arr.length - 1;
	while(min<=max){
		mid = parseInt((min+max)/2);
        if(key>arr[mid]){
            min = mid +1;
		}else if(key<arr[mid]){
			max = mid -1;
		}else{
			return mid;
		}
    }
    return -1;
}
var arr=[1,2,3,5,6,7,8,10];
var index = halfSearch(arr,6);  // 4

// 持续更新

转载于:https://my.oschina.net/shuaihong/blog/3030989