二分查找

二分查找又称折半查找，优点是比较次数少，查找速度快，平均性能好；其缺点是要求待查表为有序表，且插入删除困难。因此，折半查找方法适用于不经常变动而查找频繁的有序列表。首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以上过程，直到找到满足条件的记录，使查找成功，或直到子表不存在为止，此时查找不成功。

例子：

假如有一个Int数组:

class Program
    {
        static void Main(string[] args)
        {

            int[] iarray = new int[] { 2, 6, 4, 98, 5, 16, 9, 8, 7, 44 };
            sort(iarray);
            try
            {
                Console.WriteLine(search(iarray));
            }
            catch
            {
                Console.WriteLine("This num is not in this Array or you enter an invalid num!");
            }
            Console.ReadKey();
          
        }
        static int search(int[] array)
        {
            int low = 0;
            int high = array.Length - 1;
            Console.WriteLine("Please input a number:");
            int i = int.Parse(Console.ReadLine());
            while (low <= high)
            {
                int middle = (low + high) / 2;
                if (i == array[middle])
                {
                    return i;
                }
                else if (i < array[middle])
                {
                    high = middle - 1;
                }
                else
                {
                    low = middle + 1;
                }
            }
            //throw new Exception();
            return -1;
        }
        static void sort(int[] array)//首先必须排序！
        {
            for (int i = 1; i < array.Length; i++)
            {
                for (int j = 0; j < array.Length - i; j++)
                {
                    if (array[j] > array[j + 1])
                    {
                        int tempt = array[j];
                        array[j] = array[j + 1];
                        array[j + 1] = tempt;
                    }
                }
            }
        }
    }