快排
#include<iostream>
using namespace std;
const int maxn=10010;
int a[maxn];
void quick_sort(int a[],int l,int r)
{
if(l>=r)return ;//判断边界
int x=a[l],i=l-1,j=r+1;//双指针
while(i<j)
{
do i++;while(a[i]<x);
do j--;while(a[j]>x);
if(i<j)swap(a[i],a[j]);
}
quick_sort(a,l,j);
quick_sort(a,j+1,r);
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
quick_sort(a,0,n-1);
for(int i=0;i<n;i++)
{
if(i!=0)
{
cout<<" ";
}
cout<<a[i];
}
return 0;
}
归并排序
分析
#include<iostream>
using namespace std;
const int maxn=10010;
int q[maxn],tmp[maxn];
void merge_sort(int q[], int l, int r)
{
if (l >= r) return;//边界
int mid = (l+r)/2;//取中点
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]) tmp[k ++ ] = q[i ++ ];
else tmp[k ++ ] = q[j ++ ];
while (i <= mid) tmp[k ++ ] = q[i ++ ];
while (j <= r) tmp[k ++ ] = q[j ++ ];
for (i = l, j = 0; i <= r; i ++, j ++ ) q[i] = tmp[j];
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>q[i];
}
merge_sort(q,0,n-1);
for(int i=0;i<n;i++)
{
if(i!=0)
{
cout<<" ";
}
cout<<q[i];
}
return 0;
}
二分查找