归并排序算法——Merge Sort

c++实现的归并排序算法

#include <iostream>
using namespace std;
void Merge(int A[], int p, int q, int r)
{
    int n1 = q - p + 1;
    int n2 = r - q;
    int L[10];
    int R[10];
    for(int i = 0; i < n1; i++)
        L[i] = A[p + i];
    for(int i = 0; i < n2; i++)
        R[i] = A[q + i + 1];
    L[n1] = 100;
    R[n2] = 100;
    int i = 0;
    int j = 0;
    for(int k = p; k <= r; k++)
    {
        if(L[i] > R[j])
        {
            A[k] = R[j];
            j++;
        }
        else
        {
            A[k] = L[i];
            i++;
        }
    }
}
void Merge_Sort(int A[], int p, int r)
{
    if(p < r)
    {
		int q = (p + r) / 2;
		Merge_Sort(A, p, q);
		Merge_Sort(A, q + 1, r);
        Merge(A, p, q, r);
    }
}
int main()
{
    int A[9] = {9, 8, 7, 6, 5, 4, 3, 2, 1};
    Merge_Sort(A, 0, 8);
    for (int i = 0; i < 9; i++)
        cout << A[i] << endl;
//	system("pause");
    return 0;
}