快排
void qsort(int q[],int l,int r){
if(l>=r) return;
int x=q[l],i=l-1,j=r+1;
while (i<j){
do i++;while(q[i]<x);
do j--;while(q[j]>x);
if(i<j) swap(q[i],q[j]);
}
qsort(q,l,j);
qsort(q,j+1,r);
}
二分
int binary_search(int arr[],int x,int n) {
int left = 0;
int right = n - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == x) {
return mid;
} else if (arr[mid] < x) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}