Binary Search with recursion

// Binary search

function BinarySearch(arr,value,start,end) {
if(start>end)
return false
let mid=Math.floor((start+end)/2)
if(arr[mid]==value)
return true
if(arr[mid]>value)
return BinarySearch(arr,value,start,mid-1)
return BinarySearch(arr,value,mid+1,end)
}

const arr=[1,21,23,64,75,86]

console.log(BinarySearch(arr,86,0,arr.length-1))