题目描述

blablabla

样例

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1e6+10;
int q[N];
int temp[N];

void mergeSort(int q[],int low,int high){
    if(low>=high) return;
    int k=0;
    int mid=low+high>>1;
    int i=low;
    int j=mid+1;

    mergeSort(q,low,mid);
    mergeSort(q,mid+1,high);

    while(i<=mid && j<=high) temp[k++]=q[i]<=q[j]?q[i++]:q[j++];
    while(i<=mid) temp[k++]=q[i++];
    while(j<=high) temp[k++]=q[j++];

    for (i=low,j=0; i <= high; i ++,j++ ) q[i]=temp[j];

}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i ++ ){
        scanf("%d", &q[i]);
    }

    mergeSort(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