快速排序:
void qsort(int a[],int l,int r)
{
int x=a[l];
int i=l;
int j=r;
if(l>=r)
return ;
while(i<j)
{
while(i<j&&a[j]>=x)
j--;
a[i]=a[j];
while(i<j&&a[i]<=x)
i++;
a[j]=a[i];
}
a[i]=x;
qsort(a,l,i-1);
qsort(a,i+1,r);
}
二分查找
/*二分查找的数据序列必须是有序的,所以要用到快速排序*/
int binsearch(int a[],int l,int r,int key)
{
int low=l,high=r,mid;
if(l<=r)
{
mid=(low+high)/2;//如果low和high的数据比较大,加起来会超int内存,就用mid=low+(high-low)/2;
if(a[mid]==key)
return mid;
else if(a[mid]>key)
return binsearch(a,low,mid-1,key);
else
return binsearch(a,mid+1,high,key);
}
return -1;//当low>high的时候表示查找区间为空,查找失败;
}
二分查找求上界(即大于key值的最小值)
//第一种:
int up(int a[],int low,int high,int key)
{
int res=-1;
while (low<=high)
{
int mid=(low+high)/2;
if(a[mid]<key)
low=mid+1;
else
{
res=mid;
high=mid-1;
}
}
return res;
}
//第二种:
int up(int a[],int low,int high,int key)
{
if(low<high)
{
int mid=(low+high)/2;
if(a[mid]<=key)
high=mid;
else
low=mid+1;
}
return low;
}
二分查找求下界(即小于key的最大值)
//第一种:
int down(int a[],int low,int high, int key)
{
int res=-1;
while (low<=high)//注意等号
{
int mid=(high+low)/2;
if(a[mid]<=key)
{
low=mid+1;
res=mid;
}
else
high=mid-1;
}
return res;
}
//第二种:
int down(int a[],int low,int high,int key)
{
while(low<high)
{
int mid=(low+high)/2;
if(a[mid]<=key)
low=mid+1;
else
high=mid;
}
return x;
}
ps:http://blog.csdn.net/u013486414/article/details/31033009 这道题就是求上下界的,好好揣摩一下;