归并排序 一二熊猫笔记

将一组数分为两两一组后排序，然后将拍好顺序两两结合再排序，直到成为一个数组。

#include<bits/stdc++.h>
using namespace std;
 void MergeMethid(int a[], int f, int mid, int e)
{
    int t[e] ;
    int m = f, n = mid + 1, k = 0;
    while(n <= e && m <= mid)
    {
        if (a[m] > a[n]) t[k++] = a[n++];
        else t[k++] = a[m++];
    }
    while (n < e + 1) t[k++] = a[n++];
    while (m < mid + 1) t[k++] = a[m++];
    for (k = 0, m = f; m < e + 1; k++, m++) a[m] = t[k];
}

 void Sort(int a[], int f, int e)
{
    if (f < e)
    {
        int mid = (f + e) / 2;
        Sort(a, f, mid);
        Sort(a, mid + 1, e);
        MergeMethid(a, f, mid, e);
    }
}

int main()
{
int n;cin>>n;
int data[n];
for(int i=0;i<n;i++)
{
cin>>data[i];

}

/*for(int i=0;i<n;i++)
{
cout<<data[i]<<" ";}
cout<<endl;*/
Sort(data,0,n);

for(int i=0;i<n;i++)
{
cout<<data[i]<<" ";

}

}