折半查找/二分查找（c语言实现）

#include <stdio.h>

int binarySearch(int a[], int n, int key)
{
	int  low, high, mid;
	low = 1;						//return 0 代表找不到，所以从最低下标从 1 开始
	high = n;					//定义最高下标为记录末位

	while (low <= high)
	{
		mid = (low + high)/2;		//折半
		//mid = low + (high-low)*(key-a[low])/(a[high]-a[low]);//插值查找
		
		if (key < a[mid])			//若查找值比中值小
		{						
			high = mid - 1;			//最高下标调整到中位下标小一位
		}
		else if (key > a[mid])		//若查找值比中值大
		{
			low = mid + 1;			//最低下标调整到中位下标大一位
		}
		else
		{
			return mid;				//若相等则说明mid即为查找到的位置
		}
	}
	return 0;					//返回0，即没有找到  所以low从下标1开始
}

int main()
{
	int a[11] = {0,1,16,24,35,47,59,62,73,88,99};
	int index;
	index = binarySearch(a, 10, 1);
	printf("%d\n", index);
	index = binarySearch(a, 10, 11);
	printf("%d\n", index);
	
	return 0;
}

运行结果：

简单表示：

#include <stdio.h>  
//非递归版本  
int binarySelect(int a[], int low, int high, int value)  
{  
    int mid = 0;  
    while (low <= high)  
    {  
        mid = (low + high) / 2;  
        if (a[mid] > value)  
        {  
            high = mid - 1;  
        }  
        else if (a[mid] < value)  
        {  
            low = mid + 1;  
        }  
        else  
        {  
        	while (a[--mid] == value); //返回下标最小的目标数
            return mid + 1;
        }  
    }  
    return -1;  
}  
//递归版本  
int binarySelect2(int a[], int low, int high, int value)  
{  
    int mid = (low + high) / 2;  
    if (low > high)  
    {  
        return -1;  
    }  
    if (a[mid] == value)  
    {  
        return mid;  
    }  
    if (a[mid] > value)  
    {  
        binarySelect2(a, low, mid - 1, value);  
    }  
    else  
    {  
        binarySelect2(a, mid + 1, high, value);  
    }  
}  
  
int main()  
{  
    int a[10] = {1,2,3,4,5,6,7,8,10,10}; 
    int ret = binarySelect(a, 0, 10, 10);  
    printf("%d\n", ret);  
    ret = binarySelect2(a, 0, 10, 10);  
    printf("%d\n", ret);  
    return 0;  
}  

运行结果：