C语言 实现归并排序算法

 // Completed on 2014.10.11 17:20 // Language: C99 // // 版权所有（C）codingwu  (mail: oskernel@126.com) // 博客地址：http://www.cnblogs.com/archimedes/ #include #includevoid merge_sort(int *list, const int first, const int last) { int len= last-first+1; int left_min,left_max;  //左半区域边界 int right_min,right_max; //右半区域边界 int index; int i; int *tmp; tmp = (int *)malloc(sizeof(int)*len); if( tmp == NULL || len <= 0 ) return; for( i = 1; i  len ) right_max = len; index = 0; while( left_min  list[right_min] ? list[right_min++] : list[left_min++]); } while( left_min  0 ) { list[--right_min] = tmp[--index]; } } } free(tmp); } int main() { int a[] = {288, 52, 123, 30, 212, 23, 10, 233}; int n, mid; n = sizeof(a) / sizeof(a[0]); mid = n / 2; merge_sort(a, 0, n - 1); for(int k = 0; k 

 // Completed on 2014.10.11 18:20 // Language: C99 // // 版权所有（C）codingwu  (mail: oskernel@126.com) // 博客地址：http://www.cnblogs.com/archimedes/ #include #include void merge(int *array,const int first, const int mid, const int last) { int i,index; int first1,last1; int first2,last2; int *tmp; tmp = (int *)malloc((last-first+1)*sizeof(int)); if( tmp == NULL ) return; first1 = first; last1 = mid; first2 = mid+1; last2 = last; index = 0; while( (first1 <= last1) && (first2 <= last2) ) { if( array[first1]