Javascript递归二进制搜索功能

Question

我正在尝试构建一个递归的js函数。有明确解决方案的人请分享。

Answer 1

这是我取得的成就......

https://jsfiddle.net/21rggjdL/5/

var array = [0,1,2,3,4,5,6,7,8,9,10,11];

function myFunction(item, value, start, end) {
            var mid = Math.floor((start + end)/2);       
    while(mid>=0 && start <= end){
    if(item[mid] === value){
        return item[mid] + " at index "+ mid;
    }
        else if(item[mid] < value){
            console.log("Inside <");
        return myFunction(item, value, mid + 1, end);
    }
        else if(item[mid] > value){
            console.log("Inside >");
        return myFunction(item, value, start, mid - 1);
    }
    }
        return -1;
}
document.getElementById("demo").innerHTML = myFunction(array, 10, 0, array.length -1);