/*
Recursive Binary Search.
*/
bool BinarySearch(float[] info, float item, int from, int to)
{
	if (from > to) // Base case 1
		return false;
	else
	{
		int mid = (from + to)/2;
		if (item < info[mid])
			return BinarySearch(info,item,from,mid - 1);
		else if (item == info[mid])
			return true; // Base case 2
		else
			return BinarySearch(info,item,mid + 1, to);
		
	}
}