binary search with recursion in js

Example heading with h2 size

Example heading with h3 size

Following is sample java code.

function binaryRecursion(arr,t){
    return search(arr,t,0,arr.length)
}
function search(arr,t,left,right){
let middle = Math.floor((left+right)/2)
if(t === arr[middle]) return middle;
if(t>arr[middle]){
    return search(arr,t,middle+1,right)
}else{
    return search(arr,t,left,middle-1)
}
}
console.log(binaryRecursion([2,4,5,7,6,36,77,89],77))