实现从一组有序数组中查找最接过的值,可利用二分法查表法稍做变化实现。
首先使用二分法找到与x最接近值的基本位置(向下取整的位置)n,然后判断Array[n]与Array(n+1)哪一个距离x更近的点。二分法查找
二分法查找基本位置:
int search(int *a,int key,int low,int high)
{
int mid;
if(low > high)
{
return (high==-1)? 0: high;
}
mid = (low + high)>>2;
if(a[mid] == key)
{
return mid;
}
else if(a[mid] > key)
{
return search(a,key,low,mid -1);
}
else
{
return search(a,key,mid + 1,high);
}
}
比较最接近的点:(此部分在使用Search的地方根据精度需要进行处理,且与数据的升降序有关)
int main()
{
int a[] ={1,2,3,4,5,6,7,8,9,12,13,45,67,89,99,101,111,123,134,565,677};
int sizea = sizeof(a)/sizeof(a[0])-1; //Could be a const
int i = search(a,99,0,sizea);
if(i != sizea)
{
if( (i-(a[i]>>1) - (a(i+1) >>1)) > 0) //i > (a(i)+ a(i+1))/2
i++;
}
//i is the index of the most closed data in array a
retu
本文来自电脑杂谈,转载请注明本文网址:
http://www.pc-fly.com/a/jisuanjixue/article-26575-1.html