题目描述

blablabla

样例

#include <bits/stdc++.h>

using namespace std;

const int  N =1e6 + 10;

int q[N],temp[N],n;

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

    int k = 0, mid = l + r >> 1;

    int i = l,j = mid + 1;

    merge_sort(q,l,mid),merge_sort(q,mid + 1,r);

    while(i <= mid && j <= r){
        if(q[i] >= q[j]) temp[k++] = q[j++];
        else temp[k ++] = q[i ++];
    }
    while(i <= mid)temp[k ++] = q[i ++];
    while(j <= r) temp[k ++] = q[j ++];

    for(int i = l,k = 0; i <= r;)q[i ++] = temp[k ++];
}

int main(){
    cin>>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;
}

算法1

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

blablabla

时间复杂度

参考文献

C++ 代码

blablabla

算法2

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

blablabla

时间复杂度

参考文献

C++ 代码

blablabla