Iterative Binary Search in JavaScript

iterative-binary-search.js

const sortedList = [1,2,3,4,5,6,9,11,12,13,14,15,16,17,18,19,20]

const binarySearch = (list, item) => {
	let low = 0
	let high = list.length - 1
	let guess = null
	
	while(low <= high) {
		let mid = Math.floor((high + low)/2)
		guess = list[mid]

		if(guess === item) {
			console.log('The item is present at ' + (mid + 1) + ' position.')
		} else if (guess > item) {
			high = mid - 1
		} else {
			low = mid + 1
		}
	}
}

binarySearch(sortedList, 6)