JSFiddle - React, Tailwind, and code Playground

by Anchit Gupta

JavaScript

//binary Search
let arr = [1,2,3,4,5,6,7,8,9],
		num = 7;

const binarySearch = (arr, num) => {
	let midpoint = Math.floor(arr.length /2);
  
  
  if (num == arr[midpoint]){
  	return true;
  }
  
  if (!midpoint){
  	return false;
  }
  
  if ( num > arr[midpoint] ){
  	return binarySearch(arr.slice(midpoint+1), num);
  }else{
  	return binarySearch(arr.slice(0, midpoint), num);
  }
};

binarySearch(arr, num);