Csharp递归和循环实现折半查找

  static bool whilehalf(int n)
        {
            int low = ;  //低位
            int hight = arr.Length - ;   //高位
            int c = (hight + low)/;
            while(low <= hight)
            {
                if(n> arr[c])
                {
                    low = c + ;
                }else if(n < arr[c])
                {
                    hight = c - ;
                }else if(n == arr[c])
                {
                    Console.WriteLine("找到");
                    return true;
                }
                c = (hight + low)/;
            }
            return false;
        }

 static bool rechalf(int l, int h, int c, int n)
        {
            if(l> h)
            {
                return false;
            }else  if(arr[c] > n)
            {
                h = c - ;
                c = (h + l) / ;
                return rechalf(l, h, c, n);
            }else if(arr[c]< n)
            {
                l = c + ;
                c = (h + l) / ;
                return rechalf(l, h, c, n);
            }
            else
            {
                return true;
            }
        }