#include <stdio.h>
#include <stdlib.h>
//merge_sort -->合并排序
/*
自顶向下
采用分治法进行自顶向下的算法设计,采用递归形式更为简洁.
分治法的三个步骤
1.分解:将当前区间一分为二,即求分裂点 mid=(low+high)/2;
2.求解:递归地对两个子区间R[low..mid]和R[mid+1..high]进行归并排序;
3.组合:将已排序的两个子区间R[low..mid]和R[mid+1..high]归并为一个
有序的区间R[low..high]。
递归的终结条件:子区间长度为1(一个记录自然有序)。
*/
//一次归并过程
void merge(int a[],int low,int mid,int high ){ int *p = (int*)malloc((high-low+1)*sizeof(int));//分配内存 int k = 0,i = low,j = mid+1; while((i <= mid)&&( j <= high )){ if(a[i]<=a[j]){ p[k] = a[i++]; } else { p[k] = a[j++]; } k++; } while(i<=mid){ p[k++]=a[i++]; } while(j<=high){ p[k++]=a[j++]; } for( k = 0;k <(high-low+1);k++){ a[low+k]=p[k]; } free(p); } void merge_sort(int a[],int low,int high){ int mid = 0; if(low<high){ mid = (low+high)/2; merge_sort(a,low,mid); merge_sort(a,mid+1,high); merge(a,low,mid,high); } } int main() { int a[]={4,6,2,1,3,5,7,0}; merge_sort(a,0,7); int i; for( i = 0;i < 8;i++){ printf("%d",a[i]); } return 0; }