自顶向下归并排序

#include "stdio.h"
#include "stdlib.h"
#include "util.h"

//自顶向下归并排序
//采用分治思想,将整个数据分成最小部分,使用原地归并先将最小部分归并
//,之后再一点点进行扩大数据,最终将整个数据归并完成.
void sort(int iArray[], int lo, int hi)
{
    int mid = lo + (hi - lo) / 2;

    if ( lo >= hi )
    {
        return; 
    }

    sort(iArray, lo, mid);
    sort(iArray, mid + 1, hi);
    merge(iArray, lo, mid, hi);
}

//基于原地归并算法为基础
void merge(int iArray[], int lo, int mid, int hi)
{
    int i = lo;
    int j = mid + 1;
    int k = 0;
    int aux[100] = {0};

    for ( k = lo; k <= hi; k++ )
    {
        aux[k] = iArray[k];
    }

    for ( k = lo; k <= hi; k++ )
    {
        if ( j > hi ) 
        {
            iArray[k] = aux[i++];
            continue;
        }

        if ( i > mid )
        {
            iArray[k] = aux[j++];
            continue;
        }

        if (aux[j] < aux[i])
        {
            iArray[k] = aux[j++];
        }
        else
        {
            iArray[k]  = aux[i++];
        }
    }
}

int main()
{
    int test[] = {2, 5, 7, 30, 12, 14, 3, 6};

    sort(test, 0, 7);
    arrayShow(test, sizeof(test)/sizeof(test[0]));

    return 0;
}

#include <stdio.h>
#include "util.h"

void arrayShow(int iArray[], int size)
{
    int i = 0;

    for ( i = 0; i < size; i++ )
    {
        printf("%d ", iArray[i]);
    }
    printf("\r\n");
}

int less(int a, int b)
{
    if ( a < b ) return 1;
    return 0;
}

int compare(int a, int b)
{
    if ( a > b ) return 1;
    if ( a < b ) return -1;
    return 0;
}

void exch(int iArray[], int indexA, int indexB)
{
    int tmp = iArray[indexA];
    iArray[indexA] = iArray[indexB];
    iArray[indexB] = tmp;
}