线性表问题

线性表中元素递增有序且按顺序存储于计算机内，要求设计一算法完成用最少的时间在表中查找数值为x的元素，若找到将其与后继位置相交换，若找不到将其插入表中并使表中元素仍然递增有序

二分查找

int BinarySearch(Elemtpy x)
{
	int mid,low=0,higt=n-1;
	while(low<=high)
	{
		mid=(low+higt)>>1;
	if(A[mid]==x) return mid;
	else if(A[mid]<x) low=mid+1;
	else high=mid-1;
	}
	return -1;
}

int BinarySearch(Elemtpy x)
{
	int mid,low=0,higt=n-1;
	while(low<=high)
	{
		mid=(low+higt)>>1;
	if(A[mid]==x) return mid;
	else if(A[mid]<x) low=mid+1;
	else high=mid-1;
	}
	return -1;
}
void searchexchangeInsert(Elemtpy A[], Elemtpy x)
{
	int mid,temp;
	mid=BinarySearch(x);
	if(mid==-1)
	for(int i=n-1;A[i]>x;i--) A[i+1]=A[i]; //整体右移一位
	A[i+1]=x;
	if(mid!=-1&&mid!=n-1)
	{
		temp=A[i]; A[i]=A[i+1]; A[i+1]=temp;
	}
}