binary search list

binarysearch-list.js

const list = [1,1,2,3,5,5,5,5,10,62,95,107,109,202];

function search(list, num) {
//	console.log("Searching for :", num, "LIST:", list)
	let mid = ~~(list.length / 2);
	let item = list[mid];

	if (item === num) {
		return {isFound:true, num};
	}
	if (list.length === 1) {
		return {isFound:false, num};
	}

//	console.log("LEFT  HALF:", list.slice(0,mid))
//	console.log("RIGHT HALF:", list.slice(mid))
	if (item > num) {
		return search(list.slice(0,mid), num)
	} 
	if (item < num) {
		return search(list.slice(mid), num);
	}

}


console.log(search(list , 202));
console.log(search(list , 62));
console.log(search(list , 63));
console.log(search(list , 5));
console.log(search(list , 11));

/*

{ isFound: true, num: 202 }
{ isFound: true, num: 62 }
{ isFound: false, num: 63 }
{ isFound: true, num: 5 }
{ isFound: false, num: 11 }

*/