数组al[0,mid-1]和al[mid,num-1]是各自有序的,对数组al[0,num-1]的两个子有序段进行merge,得到al[0,num-1]整体有序
#include <stdio.h>
void sort(int a[], int mid, int len)
{
int i=0, j, k;
int temp = 0;
for(j = mid; j < len; j++)
{
for( ; i < len; i++) // for循环以i 的默认值 避免了从头开始扫描
{
if(a[i] >= a[j]) //将各个数依次向后移一位,将a[j]赋值给a[i]
{
temp = a[j];
for(k = j; k > i; k--)
{
a[k] = a[k-1];
}
a[i] = temp;
break ;
}
//printf("%d\n",count);
}
}
for(i = 0; i < len; i++)
printf("%d ",a[i]);
}
int main()
{
int i;
int a[10] = {1,3, 5, 7, 2, 3, 4, 5,6, 7};
sort(a, 4, 10);
printf("\n");
for(i = 0; i < 10; i++)
printf("%d ",a[i]);
}