归并排序

#include <iostream>
using namespace std;
class o_NlogN_MSort{
public: void MergeSort( int arr[], int left, int right  ){
    static int i = 1;
    cout << "第" << i++ << "次调用"  << endl;
        if(left >= right) ;
        else{
            int mid = left + (right - left)/2;
            MergeSort(arr, left, mid );
            MergeSort(arr, mid+1, right);
            Merge(arr, left, mid + 1, right);
        }
    }
    void Merge( int arr[], int leftpos, int rightpos, int rightEnd){
        int *temp = new int[rightEnd - leftpos +1];
        int leftEnd = rightpos - 1;
        int temppos = leftpos;
        int index = 0;
        while( leftpos <= leftEnd && rightpos <= rightEnd ){
            if( arr[leftpos] <= arr[rightpos]){
                temp[index++] = arr[leftpos++];
            }
            else{
                temp[index++] = arr[rightpos++];
            }
        }
        while( leftpos <= leftEnd ){
            temp[index++] = arr[leftpos++];
        }
        while( rightpos <= rightEnd ){
            temp[index++] = arr[rightpos++];
        }
        int j = 0;
        for (int i = temppos; i <= rightEnd ; i++,j++)arr[i] = temp[j];
        }
    void test(){
        cout << "输入元素个数" << endl;
        int a;
        cin >> a;
        int *arr = new int[a];
        cout << "输入元素"  << endl;
        for(int k = 0; k < a; k++){
            cin >> arr[k];
        }
        cout << "排序前的数组" << endl;
        for(int i = 0; i < a; i++){
            cout << arr[i] << " ";
        }
        MergeSort(arr,0,a-1);
        cout << "排序后的数组" << endl;
        for(int j = 0; j <a; j++){
            cout << arr[j] << " ";
        }
    }
};
int main()
{
    o_NlogN_MSort A;
    A.test();
    return 0;
}