题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
#include <iostream>
using namespace std;
const int N = 100010;
int a[N];
int tmp[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 i = l, j = mid+1;
int k = l;
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(int i = l; i <= r; i++)
{
q[i] = tmp[i];
}
return ;
}
int main()
{
int n;
cin>>n;
for(int i = 0;i < n; i++)
{
cin>>a[i];
}
merge_sort(a,0,n-1);
for(int i = 0;i < n; i++)
{
cout<<a[i]<< " ";
}
return 0;
}
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla