public bool Search(int[] a,int M)
{
return Search(a,0,a.Length-1,M);
}
private bool Search(int[] a, int start, int end, int M)
{
if(start > end)
{
return false;
}
if(start == end)
{
if(a[start] == M)
{
return true;
}
else
{
return false;
}
}
int mid = (start + end)/2;
if(a[mid] == M)
{
return true;
}
else if(a[mid] < M)
{
return Search(a,start,mid-1,M);
}
else
{
return Search(a,mid +1,end,M);
}
}