int main()
{
int m,n,a[100],b[100],c[200],*q,*r,i,j,k,*p;
printf("enter element in array1\n");
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d",&a[i]);
p=a;
printf("enter element in array2\n");
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&b[j]);
q=b;
r=c;
mergearr(p,q,r,m,n);
sortarr(r,m,n);
return 0;
}
int main(void)
{
int arr[] = {1,4,6,72,3,40,3,5,9};
int len = sizeof(arr)/sizeof(arr[0]);
int i = 0;
printf("排序前:\n");
for(i = 0 ;i < len ; i ++)
{
printf("%d ",arr[i]);
}
printf("\n");
sortarr(arr,len);
printf("排序后:\n");
for(i = 0; i < len; i ++)
{
printf("%d ",arr[i]);
}
printf("\n");
return 0;
}
