https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/p/challenge-binary-search如何實現二進制搜索在JavaScript
我下面的僞代碼來實現鏈接算法,但不知道什麼是錯我的代碼。
這裏是我的代碼:
/* 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(min < max) {
guess = (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, 2);
println("Found prime at index " + result);
//Program.assertEqual(doSearch(primes, 73), 20);
'while'後面,檢查'array [min] == target'或'array [max] = target'。 – 2015-04-06 08:56:14
'println()'不是Javascript中的函數。我想你想'console.log()':https://developer.mozilla.org/en-US/docs/Web/API/Console/log – 2015-04-06 09:06:18