Binary search

binary_search.js

let arr = [3,4,15,17,20,23,24,31,33,37,40,51,54]
function binary_search(a,e){
	let high = a.length-1 
	let mid = 0 
	let low = 0 
	while (low <= high) {
		mid = Math.floor((low+high)/2)
		if (a[mid] === e){
			return arr[mid]				
		}else if (a[mid] < e){
			low = mid+1 
		}else{
			high = mid-1
		}
	}
	return undefined
}
let sortedArr = arr.sort((a,b)=>{a-b})
console.log(sortedArr)
let res = binary_search(sortedArr,33)
console.log(res)