效率较高的排序

#include<stdio.h>

void mert(int s[],int u[],int left,int m,int right)

{

int i=left;

int j=m+1;

int k=left;

while(i<=m&&j<=right)

{

if(u[i]<u[j])

{

s[k]=u[i];

i++;

k++;

}

else

{

s[k]=u[j];

j++;

k++;

}

}

while(i<=m)

{

s[k++]=u[i++];

}

while(j<=right)

{

s[k++]=u[j++];

}

}

void mert_s(int s[],int t[],int left,int right)

{

int m;

int u[100];

if(left==right)

{

s[left]=t[right];

}

else

{

m=(left+right)/2;

mert_s(u,t,left,m);

mert_s(u,t,m+1,right);

mert(s,u,left,m,right);

}

}

int main()

{

int n;

int arr[100];

scanf("%d",&n);

for(int i=0;i<n;i++)

{

scanf("%d",&arr[i]);

}

mert_s(arr,arr,0,n-1);

for(int i=0;i<n;i++)

{

printf("%d ",arr[i]);

}

return 0;

}