排序算法

#include<iostream.h>
#include<string.h>
#include<stdlib.h>

void merge(int * srclist, int first, int mid, int last)
{
        int * ord_list = (int *)malloc((last - first + 1)* sizeof(int));
        int i = first, j = mid+1, k = 0;
        int t;
        while((i <= mid) && (j <= last))
        {
                if(srclist[i] < srclist[j])
                {
                        ord_list[k] = srclist[i];
                        i ++;
                        k ++;
                }
                else
                {
                        ord_list[k] = srclist[j];
                        j ++;
                        k ++;
                }
        }
        if(i > mid)
        {
                for(t = j; t <= last; t ++)
                {
                        ord_list[k] = srclist[t];
                        k ++;
                }
        }
        else
        {
                for(t = i; t <= mid ; t ++)
                {
                        ord_list[k] = srclist[t];
                        k ++;
                }
        }
        t = first;
        while(t <= last)
        {
                srclist[t] = ord_list[t - first];
                t ++;
        }
        free(ord_list);
}
/*algorithm*/
void merge_sort(int * list, int first, int last)
{
        int middle;
        if(first < last)
        {
                middle = (first + last)/2;
                merge_sort(list, first, middle);
                merge_sort(list, middle +1, last);
                merge(list, first, middle, last);
        }
}

void main()
{
	int a[10]={3,45,21,14,67,9,4,24,13,89};
	int i;
	merge_sort(a,0,9);
	for(i=0;i<10;i++)
		cout<<a[i]<<"  ";
	cout<<endl;

}