思想:
1.整个数组是无序的;然后将数组平均切分成两份;
2.分治算法:先对左边的区间进行归并排序; 再对右边的区间进行归并排序;直到size=0或size=1;
3.合并两个有序数组;
归并排序的实现:
void Merge(int array[], int left,int mid, int right, int extra[]){
int i = left;
int j = mid;
int k = 0; //extra的下标;
while (i < mid && j < right){
if (array[i] < array[j]){
extra[k++] == array[i++];
}
else{
extra[k++] = array[j++];
}
}
while (i < mid){
extra[k++] = array[i++];
}
while (j < right){
extra[k++] = array[j++];
}
//把extra的数据移回来
for (int x = left; x < right; x++){
array[x] = extra[x - left];
}
}
//[lef,right] 左闭右闭区间
void_MergeSort(int array[], int left, int right,int extra[]){
if (right = left + 1){
return;
}
if (right <= left){
return;
}
//1.把数组平均分成两部分;
int mid = left + (right-left) / 2;
[left,mid);
[mid,right);
//2.分治算法,排序左右两部分;
_MergeSort(array, left, mid,extra);
_MergeSort(array, mid, right,extra);
//3.合并两个有序数组;
[left,mid) [mid,right)
Merge(array, left, mid, right,extra);
//直到size==0;size==1;
}
void MergeSort(int array[], int size){
int *extra = (int *)malloc(sizeof(int)*size);
_MergeSort(array, 0, size,extra);
free(extra);
}