我在算法上通讀可汗學院課程。我在https://www.khanacademy.org/computing/computer-science/algorithms/sorting-algorithms/p/challenge-find-minimum-in-subarray
代碼挑戰應該循環遍歷數組查找並返回子數組中的最小數字。我寫了我認爲應該可以工作的代碼,但是我在標題中遇到了錯誤。爲什麼?
var indexOfMinimum = function(array, startIndex) {
// Set initial values for minValue and minIndex,
// based on the leftmost entry in the subarray:
var minValue = array[startIndex];
var minIndex = startIndex;
var i = minIndex + 1;
for(i ; array.length ; i+1) {
if(array[i]< minValue) {
minIndex = i ;
minValue = array[i];
}
}
// Loop over items starting with startIndex,
// updating minValue and minIndex as needed:
return minIndex;
};
var array = [18, 6, 66, 44, 9, 22, 14];
var index = indexOfMinimum(array, 2);
'array.length'(假設數組不爲空)將評估爲真。意思是你的'for'循環永遠不會退出。 –