归并排序
时间复杂度O(log(2)n);
对于数据多的情况下十分有效;
分治思想
分为分割和归并
主要难度在于分割之后进行归并的过程;
也就是说如何将多个有序的数列合成为一个数列;
这里我们可以引进一个新的数组去存储另外两个有序数列的值;
设置一个足够大得数组去能容纳数据
代码
# include <stdio.h>
void Merge ( int *a, int left, int right, int mid){
int temp [right];
int i = left;
int j = mid + 1;
int c = mid;
int _count = left;
while (i <= mid && j<= right){
if ( a[i] <= a[j]){
temp[_count++] = a[i++];
}
else
temp[_count++] = a[j++];
}
while (i <= mid){
temp[_count++] = a[i++];
}
while (j <= right){
temp[_count++] = a[j++];
}
for (i = left; i <= right; ++i){
a[i] = temp[i];
}
}
void GB (int *a, int left, int right){
if (left >= right )
return ;
int mid = (left + right)/2;
GB ( a, left, mid);
GB ( a, mid + 1, right);
Merge (a,left,right, mid);
}
int main (void){
int a[100000];
int right,n ,i;
scanf("%d",&n);
for ( i = 0; i < n; ++i){
scanf ("%d",&a[i]);
}
GB(a,0,n-1);
for ( i = 0; i < n; ++i){
printf ("%d ",a[i]);
}
return 0;
}