输入一个长度为length的有序整数数列numbers,和要查找的整数key;如找到则返回该数载数列中的位置,否则返回-1,函数声明如下
int BinarySearch(const int* numbers, int length, int key);
int BinarySearch(const int *a, const int len, const int key)
{
if ((NULL == a) || (len <= 0))
{
return -1;
}
int mid, low = 0, high = len - 1;
while(low <= high)
{
mid = low + (int)(high - low) / 2;
if(key == a[mid])
{
return mid;
}
else if(key > a[mid])
{
low = mid + 1;
}
else
{
high = mid - 1;
}
}
return -1;
//采用递归的方法二
#include <stdio.h>
int BinarySearch(const int *a, int low, int high, const int key)
{
if ( low > high)
{
return -1;
}
int mid = low + (int)(high - low) / 2;
if (key == a[mid])
{
return mid;
}
else if (key >= a[mid])
{
low = mid + 1;
BinarySearch(a, low, high, key);
}
else
{
high = mid - 1;
BinarySearch(a, low, high, key);
}
}
int main()
{
int a[] = {1,2,3,4,5,6,7,8,9,90,789,999};
int len = sizeof(a) / sizeof(a[0]);
const int key = 5;
int pos = BinarySearch(a, 0, len - 1, key);
printf("the postion of %d is in the: %d\n",key, pos);
}
在从小到大排好序的数组中,用递归的方法实现二分法查找,若存在,则返回其在数组中的位置;不存在则返回-1。
int SearchOfBinaryMethod(int *iArray,unsigned int left, unsigned int right, int key);
其中,iArray为数组,left,right分别为数组中第一,最后一个元素的位置,key为要查找的数字。
#include <stdio.h>
int BinarySearch(const int *a, const int len, const int key)
{
if ((NULL == a) || (len <= 0))
{
return -1;
}
int mid, low = 0, high = len - 1;
while(low <= high)
{
mid = low + (int)(high - low) / 2;
if(key == a[mid])
{
return mid;
}
else if(key > a[mid])
{
low = mid + 1;
}
else
{
high = mid - 1;
}
}
return -1;
}
int main()
{
int a[] = {1,2,3,4,5,6,7,8,9,90,789,999};
int len = sizeof(a) / sizeof(a[0]);
const int key = 5;
int pos = BinarySearch(a, len, key);
printf("the postion of %d is in the: %d\n",key, pos);
}