binarySearch.js

const comparatorF = (element, needle) => element - needle

const binarySearch = (list, needle, comparator = comparatorF) => {
	if (!needle || !list) return null

	let min = 0
	let max = list.length - 1

	while (min <= max) {
		const mid = Math.floor(min + (max - min) / 2)
		const quess = list[mid]
		const compared = comparator(quess, needle)

		if (compared === 0) {
			return quess
		} else if (compared > 0) {
			max = mid - 1
		} else {
			min = mid + 1
		}
	}

	return null
}

export default binarySearch