787. 归并排序

787. 归并排序

#include<iostream>
using namespace std;

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

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

    int mid = (l + r) / 2;

    //递归划分左边以及右边
    merge_sort(q,l,mid);
    merge_sort(q,mid+1,r);


    //归并  i j 分别指向左半边与右半边
    int k = 0;
    int i = l;
    int j = mid + 1;

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

    while(i <= mid)
    {
        temp[k] = q[i];
        k++;
        i++;
    }

    while(j <= r)
    {
        temp[k] = q[j];
        j++;
        k++;
    }

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


int main()
{
    scanf("%d",&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]);
    }

    system("PAUSE");
    return 0;
}