冒泡排序:
void bubble(int a[],int n){
int t,loop=1;
for(int i=1;i<n && loop==1;i++){
loop=0;
for(int j=0;j<n-i;j++){
if(a[j]>a[j+1]){
loop=1;
t=a[j+1];
a[j+1]=a[j];
a[j]=t;
}
}
}
}
二分查找:
int bsearch(int *p,int x,int n){
int low=0,high=n-1,mid;
while(low<=high){
mid=(low+high)/2;
if(p[mid]==x) break;
else if(x<p[mid]){
high=mid-1;
}else{
low=mid+1;
}
}
if(low<=high)
return mid;
else
return -1;
}