二分查找算法

public static int BinSort(int[] array,int key)
{
    int low = 0;
    int high = array.Length - 1;
    int mid = 0;
    int n = 0;
    while (low <= high)
    {
        n++;
        mid = (low + high) / 2;
        Console.WriteLine(" Low="+low +" High="+high +" Mid="+mid);
        if (array[mid] == key)
        {
            Console.WriteLine("共查找"+n+"次");
            return mid;
        }
        if (array[mid] > key)
            high = mid - 1;
        else
            low = mid + 1;
    }
    return -1;
}