Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 | 1x 8x 8x 8x 8x 8x 18x 18x 18x 18x 8x 10x 3x 7x 1x | let BinarySearch = {
/**
* Searches for an item in an array which matches a certain condition.
* This requires the condition to only match one item in the array,
* and for the array to be ordered.
*
* @param {Array} list The array to search.
* @param {Function} comparisonFunction
* Called and provided a candidate item as the first argument.
* Should return:
* > -1 if the item should be located at a lower index than the provided item.
* > 1 if the item should be located at a higher index than the provided item.
* > 0 if the item is the item you're looking for.
*
* @return {*} The object if it is found or null otherwise.
*/
search: function (list, comparisonFunction) {
let minIndex = 0;
let maxIndex = list.length - 1;
let currentIndex = null;
let currentElement = null;
while (minIndex <= maxIndex) {
currentIndex = (minIndex + maxIndex) / 2 | 0;
currentElement = list[currentIndex];
let comparisonResult = comparisonFunction(currentElement);
if (comparisonResult > 0)
minIndex = currentIndex + 1;
else if (comparisonResult < 0)
maxIndex = currentIndex - 1;
else
return currentElement;
}
return null;
}
};
export default BinarySearch;
|