代码

int binary_search(const unsigned *a, int n, unsigned x)
{
	int Min=a[0],Max=a[n-1];
	int id=(int)((float)(x-Min)/(Max-Min)*(Max-Min));
	while(a[id]>x)id--;
	while(a[id]<x)id++;
	return id;
}

评测结果