#include<stdio.h>
//归并:把集合拆分成n个有序子集,再合并n有序子集
//稳定排序,时间复杂度:(n*log2 n)
void merger_sort(int * ptr_array1,int length1,int * ptr_array2,int length2)
{
int ptr_array[length1+length2];
int i,j,k;
i=j=k=0;
while(i<length1 && j<length2)
{
if(ptr_array1[i]<ptr_array2[j])
{
ptr_array[k++]=ptr_array1[i++];
}
else
{
ptr_array[k++]=ptr_array2[j++];
}
}
while(i<length1)
{
ptr_array[k++]=ptr_array1[i++];
}
while(j<length2)
{
ptr_array[k++]=ptr_array2[j++];
}
for(i=0;i<length1+length2;i++)
{
ptr_array1[i]=ptr_array[i];
}
}
void sort(int * array,int length)
{
//拆分成length个子集 排序再合并
if(length>1)
{
int * ptr_array1=array;
int length1=length/2;
int * ptr_array2=ptr_array1+length1;
int length2=length-length1;
sort(ptr_array1,length1);
sort(ptr_array2,length2);
merger_sort(ptr_array1,length1,ptr_array2,length2);
}
}
int main(int argc, char const *argv[])
{
int array[]={109,2773,120,15,88,1,221,34};
sort(array,8);
int i;
for(i=0;i<8;i++)
{
printf("%d\t",array[i]);
}
printf("\n");
return 0;
}
运行结果: