归并排序算法实现

void merge_sort_impl(int* storage, int* array, int low, int mid, int high)
{
    int i = low;
    int j = low;
    int k = mid;

    if((low + 1) < mid)
    {
        int x = low + ((mid - low) >> 1);
        merge_sort_impl(storage, array, low, x, mid);
    }

    if((mid + 1) < high)
    {
        int x = mid + ((high - mid) >> 1);
        merge_sort_impl(storage, array, mid, x, high);
    }


    while(j < mid && k < high)
    {
        if((array[j]-array[k]) <= 0)
        {
            storage[i++] = array[j++];
        }
        else
        {
            storage[i++] = array[k++];
        }
    }