main.cpp

来自「设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0<I&」· C++ 代码 · 共 26 行

#include<iostream>
using namespace std;

int search(int a[],int n)
{
	int left=0;
	int right=n-1;
	while(left<=right)
	{
		int mid=(left+right)/2;
		if (a[mid]==mid) return mid;
		if (a[mid]< mid) left=mid+1;
		else right=mid-1;
	}
	return -1;
}

int main()
{
	int a[]={-4,-2,1,2,3,4,5,7,9};
	int b[]={-9,-6,-5,-4,-1,3,4,5,6,7,9,10,15};
	cout <<search(a,9)<<endl;
	cout <<search(b,12)<<endl;
	return 0;
}