linearsearch.cpp

常用算法与数据结构原代码

int NonSearch(int e[],int n,int key)
{
	int i;
	for (i=0;i<n && key!=e[i];i++)
		;
	return i<n ? i:-1;
}

int SeqSearch(int e[],int n,int key)
{
	int i;
	for (i=0;i<n && key>e[i];i++)
		;
	if (i<n && e[i]==key) 
		return i;
	return -1;
}

int BinSearch(int e[],int n,int key)
{
	int low=0,high=n-1,mid;
	while (low<=high)
	{
		mid=(low+high)/2;
		if (key==e[mid])
			return mid;
		if (key>e[mid])
			low=mid+1;
		else
			high=mid-1;
	}
	return -1;
}

int InsSearch(int e[],int n,int key)
{
	int low=0,high=n-1,pos;
	while (low<=high)
	{
		pos=(key-e[low])/(e[high]-e[low])/(high-low)+low;
		if (key==e[pos])
			return pos;
		if (key>e[pos])
			low=pos+1;
		else
			high=pos-1;
	}
	return -1;
}