javascript - 使用 while 语句进行二分查找

Question

我几乎不好意思问这个问题，但出于某种原因我无法让它发挥作用。这是可汗学院关于二分搜索的练习。 https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/p/challenge-binary-search

任何帮助将不胜感激!谢谢!

编辑:我应该编辑这个，说我从可汗学院收到的错误消息是“看起来你在 while 循环上几乎有正确的条件，但仍然有问题。”这并不是特别有帮助。

/* Returns either the index of the location in the array,
  or -1 if the array did not contain the targetValue */
var doSearch = function(array, targetValue) {
	var min = 0;
	var max = array.length - 1;
    var guess;
    while(max > min) {
        guess = Math.floor((max+min)/2);
        if(array[guess] === targetValue) {
            return guess;
        } else if (array[guess] < targetValue) {
            min = guess + 1;
        } else {
            max = guess - 1;
        }
    }
	return -1;
};

var primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 
		41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97];

var result = doSearch(primes, 73);
println("Found prime at index " + result);

Program.assertEqual(doSearch(primes, 73), 20);

Answer 1

更改此:

while(max > min)

至

while(max >= min)