bsc
Version:
Binary search with comparator
27 lines (20 loc) • 452 B
JavaScript
var binarySearch = function binarySearch(arr, comparator) {
var start = 0;
var end = arr.length - 1;
while (start <= end) {
var _item = Math.floor((start + end) / 2);
var cmp = comparator(arr[_item]);
if (cmp < 0) {
end = _item - 1;
continue;
}
if (cmp > 0) {
start = _item + 1;
continue;
}
return _item;
}
return -1;
};
export default binarySearch;
//# sourceMappingURL=index.js.map