C#面试必会经典算法总结：搜索与排序

c#中的二分查找算法
public int search(int[] q) 
{ 
int i, low = 0, high = q.Length - 1, middle; 
Console.Write("请输入想要查找的数字:"); 
i=int.Parse(Console.ReadLine()); 
while (low <= high) 
{ 
middle = (low + high) / 2; 
if (i == q[middle])return i; 
if (i < q[middle])high = middle - 1; 
else low = middle + 1; 
} 
throw new Exception("数组中不存在这个数。"); 
}

你这个递归二分查找好象有点问题
这块少一个是否超出边界的判断
result = (key < A[k]) ? search(A, p, k-1, key) : search(A, k+1, q, key);
看看下面这段是否会清楚一些
public int recursiveSearch(int[] source, int p, int r, int key){
int result = -1;
int left = p;
int right = r;
int q = p + (r-p)/2; 

if (source[q] == key) 
return result = q;
else {
if (source[q] < key)

left = q +1; 
else
right = q -1;

if (left <= right)
result = recursiveSearch(source,left,right,key);
} 
return result;
} 




C# 实现的二分查找法     
using System;
using System.Collections.Generic;
using System.Text;

namespace structure
{
    /// <summary>
    /// 二分查找法
    /// </summary>
    class Program
    {
        static int search(int[] q)
        {
            int i, low = 0, high = q.Length - 1, middle;
            Console.Write("Please enter your search num: ");
            i = int.Parse(Console.ReadLine());