C#二分法查找 非递归

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Binary_Search
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] a = { 0, 1, 2, 3, 4, 5, 6 };
            int number = int.Parse(Console.ReadLine());  //输入一个数
            int rr = BinarySearch(a, 0, a.Length - 1, number); //查找数并返回 若有，返回该数，没有则返回-1
            Console.WriteLine("{0}", rr);
            Console.ReadKey();
        }


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


    }

   

}