数组前半部分和后半部分有序的全排序

例如:

已知数组a前半部分a[0,mid - 1],后半部分a[mid,num-1]，现前半部分和后半部分均已排好序。要求：实现a数组的从小到大排序。空间复杂度为O(1).

#include <iostream>
using namespace std;

void PrintArry(int v[],int len)
{
    for(int i = 0; i < len; i ++)
        cout<<v[i]<<" ";
    cout<<endl;
}

void MergeSort(int *v, const int len, const int mid)
{  
    int i, temp;
    int left = 0, right = mid;

    while (left < right && right < len)
    {
        while (v[left] < v[right]) {
            ++ left;
        } 

        temp = v[right];
        for(i = right; i > left ; -- i) {
            v[i] = v[i-1];
        }
        v[left] = temp;

        //move the current right postion
        ++ right;   
    }

}

int main(int argc, char **argv)
{
    //int arry[]={1,3,5,7,9,3,4,6,8};
    //int arry[]={1,3,5,7,9,7,8,9,9,11};
    //int arry[] = {0,2,4,6,8,8,9,9,1000,1,3,5,7,10,11,12,14,16,18,20,21,23,25,45,68};     
    int v[] = {100,1,3,5,7,10,11,12,14,16,18,20,21,23,25,45,68}; 
    int len = sizeof(v) / sizeof(int);
    PrintArry(v, len);
    MergeSort(v, len, 1);
    PrintArry(v, len);
    return 0;
}