归并排序是排序算法中效率比较高的一种,运用了递归分治的思想,它将一串待排序列递归两两拆分,直到每个子序列长度为 1,然后两两归并成为一个有序子序列,最终使得整个序列有序
#include <stdio.h>
//合并数组中两个有序部分
void merge(int arr[], int L, int R, int M) {
int LEFT_SIZE = M - L;
int RIGHT_SIZE = R - M + 1;
int left[LEFT_SIZE];
int right[RIGHT_SIZE];
int i, j, k;
//fill in the left and right array
for(i = L; i < M; i++) {
left[i-L] = arr[i];
}
for(i = M; i <= R; i++){
right[i-M] = arr[i];
}
//merge into the original array
i = j = 0;
k = L; //注意k的初始值
while(i != LEFT_SIZE && j != RIGHT_SIZE) {
if (left[i] > right[j]) {
arr[k] = right[j];
j++;
}
else {
arr[k] = left[i];
i++;
}
k++;
}
if(i == LEFT_SIZE) {
while(j != RIGHT_SIZE) {
arr[k] = right[j];
j++; k++;
}
}
else {
while(i != LEFT_SIZE) {
arr[k] = left[i];
i++; k++;
}
}
}
//归并排序 - 递归实现
void mergeSort(int arr[], int L, int R) {
int M = (L + R) / 2;
if(L == R) {
return;
}
else{
mergeSort(arr, L, M);
mergeSort(arr, M+1, R);
merge(arr, L, R, M+1);
}
printf("...\n");
}
int main() {
int arr[] = {6,8,10,9,4,5,2,7};
mergeSort(arr,0,7);
int i = 0;
for(i = 0; i < 8; i++) {
printf("%d\n", arr[i]);
}
return 0;
}