版权声明:本文为博主原创文章,转载请发邮件到[email protected]授权。 https://blog.csdn.net/qq_33712555/article/details/84064478
递归二分法
/// <summary>
/// 二分查找法
/// </summary>
private int DivSearch(int num, int low, int high, int [] arr)
{
int middle = (low + high) / 2 ;
while (low <= high)
{
if (num < arr[middle])
{
return DivSearch(num, low, middle - 1, arr);
}
else if (num > arr[middle])
{
return DivSearch(num, middle + 1, high, arr);
}
else
{
return middle;
}
}
return middle;
}