归并排序
-
确定分界点:mid:(l+r)/2
-
递归排序左右
-
归并:合二为一 双指针 比较两个有序数组写入新创建的数组 (稳定的)
-
时间复杂度:O(n)
-
代码:
#include<stdio.h>
int n;
int q[1000010], temp[1000010];
void merge_sort(int q[], int l, int r) {
if(l >= r) return;
int mid = (l + r) / 2;
merge_sort(q, l, mid);
merge_sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while(i <= mid && j <= r) {
if(q[i] < q[j]) {
temp[k++] = q[i++];
} else {
temp[k++] = q[j++];
}
}
while(i <= mid) temp[k++] = q[i++];
while(j <= r) temp[k++] = q[j++];
for(i = l, j = 0; i <= r; i++, j++) q[i] = temp[j];
}
int main() {
scanf("%d", &n);
int i;
for(i = 0; i < n; i++) {
scanf("%d", &q[i]);
}
merge_sort(q, 0, n - 1);
for(i = 0; i < n; i++) {
printf("%d ", q[i]);
}
return 0;
}