归并排序

归并排序

*

解决了自己对数组内部排序的问题

*
—————————

#include<stdio.h>
#include<stdlib.h>
void Merge(int a[], int low, int mid, int  high)
{
    int i, j,k;
    int  * b = (int *)malloc((high - low + 1)*sizeof(int)); // 临时创建一个复制数组，有点动态建数组的感觉，^_^
    for ( k = low; k <= high; k++)   //进行数组复制
    {
        b[k] = a[k];
    }
    for (i = low, j = mid + 1, k = i; i <= mid &&j <= high; k++)
    {
        if (b[i] < b[j])
            a[k] = b[i++];
        else
        {
            a[k] = b[j++];
        }
    }
    while (i <= mid)
        a[k++] = b[i++];
    while (j <= high)
        a[k++] = b[j++];

}
void Merge_Sort(int a[], int low, int high)
{
    int mid = (low + high) >> 1;
    if (low < high)
    {

        Merge_Sort(a, low, mid);
        Merge_Sort(a, mid + 1, high);
        Merge(a, low, mid, high);
    }

}
void main()
{

    int a[5] = { 1, 3, 5, 2, 4 };
    Merge_Sort(a, 0,4);
    for (int i = 0; i < 5; i++)
        printf("%d\t", a[i]);

    getchar();
}