BlueBreeze

<?php
function binsearch($arr, $val)
{
	$len = count($arr);
	$low = 0;
	$high = $len - 1;
	
	//if $val is greater than the greatest value or small than the smallest value in that array, don't bother to search.
	if ($val < $arr[$low] || $val > $arr[$high])
	{
		return "$val is not found";
	}
	
	while ($low <= $high)
	{
		$mid = round(($low + $high) / 2);
		
		if ($arr[$mid] < $val)
		{
			$low = $mid + 1;
		}
		else if ($arr[$mid] > $val)
		{
			$high = $mid - 1;
		}
		else
		{
			return $mid;
		}
	}
	
	//not found
	return "$val not in that array";
}

<?php
function binsearch($arr, $val, $low, $high)
{
	
	if ($val < $arr[$low] || $val > $arr[$high])
	{
		return "$val is not found";
	}
	
	if ($low <= $high)
	{
		$mid = round(($low + $high) / 2);
		
		if ($arr[$mid] == $val)
		{
			return $mid;
		}
		else if ($arr[$mid] > $val)
		{
			return binsearch($arr, $val, $low, $mid - 1);
		}
		else if ($arr[$mid] < $val)
		{
			return binsearch($arr, $val, $mid + 1, $high);
		}
	}
	else
	{
		return "$val is not found";
	}
	
}