php递归实现二分算法

class bestSearch
{
	public function cSearch($value,$low,$high,$i=0)
	{
		$i++;
		$mid=ceil(($low+$high)/2);
		if($value<$mid){
			$high=$mid;
			$this->cSearch($value,$low,$high,$i);
		}elseif($value>$mid){
			$low=$mid;
			$this->cSearch($value,$low,$high,$i);
		}else{
			echo $mid.'---'.$i;die();
		}
	}
}
 $b=new bestSearch();
 echo $b->cSearch(199,0,10000,0);