Binary Search

BinarySearch.cs

void Main()
{
	BinarySearch(new int[]{1,3,4,5,9,10},1).Dump();
}

int BinarySearch(int[] array,int x)
{
	int low = 0;
	int high = array.Length - 1;
	
	while (low <= high)
	{
	 	int mid = low + (high - low)/2;
		if(array[mid]==x)
			return mid;
		if(array[mid]<x)
		{
			low = mid + 1;
		}
	    if(array[mid]>x)
		{
			high = mid - 1;
		}
		
	}
	return -1;
}