折半查找的概念及算法

折半查找的概念及算法

时间复杂度：O(log2(n))

int BinSrch(List l, KeyType k)
{
	int low=1, high=l.length, mid;
	while(low<=high)
	{
		mid=(low+high)/2;
		if(k==l.r[mid].key)
			return mid;
		else
			if(k<l.r[mid].key)
				high=mid-1;
			else
				low=mid+1;
	}
	return 0;
}