题目描述

blablabla

样例

blablabla

算法1

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

blablabla

算法2

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

#include <iostream>
using namespace std;

const int N = 100010;
int n;
int q[N], temp[N];

void mergesort(int q[], int l, int r)
{
    if(l >= r) return;

    int mid = (l + r) / 2;

    mergesort(q, l, mid), mergesort(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(i = l, j = 0; i <=r; i++, j++) q[i] = temp[j];
}

int main()
{
    cin>>n;
    for(int i = 0; i < n; i++) cin>>q[i];
    mergesort(q, 0, n-1);
    for(int i = 0; i < n; i++) cout<<q[i]<<" ";
    cout<<endl;
    return 0;
}