【Acwing】（一）基础算法

快速排序

#include<iostream>
using namespace std;
const int N = 1e+6;
int q[N];
int n;
void quick_sort(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);
        swap(q[i],q[j]);
    }
    quick_sort(q,l,j);  %注意避免死循环[0,1] [0,1],如果i>j就退出去了
    quick_sort(q,j+1,r);
int main ()
{
    scanf("%d",&n);
    for (int i = 0;i<n;i++)
    scanf("%d",&q[i]);
    quick_sort(q,0,n-1);
    for (int i =0;i<n; i++)
    printf("%d ",q[i]);
    return 0;
    
}

归并排序

#include<iostream>
using namespace std;
const int N=100000;
int n;
int q[N],temp[N];
void merge_sort(int q[],int l,int r)
{
    if (l>=r)
    return;
    int mid = l+r>>1;
    merge_sort(q,l,mid);
    merge_sort(q,mid+1,r);
    int k=0,i=l,j=mid+1;
    while(i<=mid && j<=r)
    {
        if (q[i]<q[j]) temp[k++]=q[i++];
        else temp[k++]=q[j++];
    }
    while(i<=mid) temp[k++]=q[i++];
    while(j<=r) temp[k++]=q[j++];
    for (k=0,i=l;i<=r;k++,i++)
    q[i]=temp[k];
    
}
int main()
{
    scanf("%d",&n);
    for (int i=0;i<n;i++)
    scanf("%d",&q[i]);
    merge_sort(q,0,n-1);
    for (int i=0;i<n;i++)
    printf("%d ",q[i]);
    return 0;
}

 

整数二分法

#include<iostream>
using namespace std;
const int N =100000;
int n,m;
int q[N];

int main()
{
   scanf("%d%d",&n,&m);
   for (int i=0;i<n;i++)
   scanf("%d",&q[i]);
   while(m--)
   {
       int x;
       scanf("%d",&x);
       int l = 0,r = n-1;
       while(l<r)
       {
           int mid =l+r>>1;
           if (q[mid]>=x) r=mid;
           else l = mid+1;
       }
       if (q[l]!=x) cout<<"-1 -1"<<endl;
       else
       {
           cout<<l<<" ";
           int l = 0,r = n-1;
           while(l<r)
           {
               int mid =l+r+1>>1;
               if (q[mid]<=x) l =mid;
               else r = mid-1;
           }
           cout<<l<<endl;
       }
       
       
   }
    return 0;
}

浮点数二分

#include<iostream>
using namespace std;
int main()
{
    double x;
    cin>>x;
    double l = 0,r=x;
    while(r-l>0.00001)
    {
        double mid  =(l+r) /2;
        if (mid*mid>=x) r = mid;
        else l = mid;
    }
    printf("%f",l);
    return 0;   
}