二分查找排序<递归>

public function binarySearchRecursionSort(array $arr,$value,$left,$right) :int
{
if($left > $right) return -1;
$middle = (int)(($left+$right)/2);
if($arr[$middle] > $value){
return $this->binarySearchRecursionSort($arr,$value,$left,$middle-1);
}elseif ($arr[$middle] < $value){
return $this->binarySearchRecursionSort($arr,$value,$middle+1,$right);
}else{
return $middle;
}
}
�