/*二路归并排序，递归*/

二路归并排序，递归 /。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。/

：喜欢编码，更想要有个人陪。请原谅这周对编码的应付。

#include <stdio.h>

/*二路归并排序，递归*/
void merge(int a[],int t[],int low,int mid,int high)
{
int i = low,j = mid+1,k = low;
while(i<=mid && j<=high)
{
if(a[i] < a[j])
{
t[k] =a[i++]; 
}
else 
{
t[k] = a[j++];
}
k++;
}
while(i <= mid)
{
t[k++] = a[i++];
}
while(j <= high)
{
t[k++] =a[j++];
}
for(int i = low; i <=high; i++)
{
a[i] = t[i];
}

}
void mergesort(int s[],int t[],int low, int high)
{
if(low < high)
{

int mid= (low + high)/2;
mergesort(s,t,low,mid);
mergesort(s,t,mid+1,high);
merge(s,t,low,mid,high);
}
}

/*test*/
int main(int argc, char *argv[])
{
int s[10] = {1,92,3,21,34,32,1,23,40,34};
int t[10] ={0};
mergesort(s,t,0,9);
for(int i = 0; i< 10;i++)
printf("%d ",s[i]);

return 0;
}