C#中的二分查找

C#中的 二分查找 的步骤

1、数组
2、开始索引
3、结束索引
4、要查找的对象
5、对象所在的索引位置

 

示例代码：

public static int BinarySearch(int[] arr ,int low, int hight,int key)
        {
            int mid = (low + hight) / 2;
            if (low>hight)
            {
                return -1;
            }
            else
            {
                if (arr[mid] == key)
                {
                    return mid;
                }
                else if(arr[mid] > key)
                {
                    return BinarySearch(arr, low, mid - 1, key);
                }
                else
                {
                    return BinarySearch(arr, mid + 1, hight, key);
                }
            }

        }

    int[] y = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
            int rr = BinarySearch(y, 0, y.Length - 1, 5);
            Console.Write(rr);

            Console.Read();