Binary search without recursion

// Binary Search .....

function BinaySearch(arr,value) {
let l=0;
let h=arr.length-1

while(l<=h){
let mid=Math.floor((l+h)/2)
if(arr[mid]==value){
return true
}
if(arr[mid]<value){
l=mid+1

}else{
 h=mid-1
}

}
return false

}

console.log(BinaySearch([1,2,4,5,8,9,13,24,53],1))