大牛帮我看一下下面的代码怎么优化;
#include <stdio.h>
int i;
int n=0;
int sortarray(int a[10])//正序加
{
for(i=n;i<10-n;i++){
(a[i+1]<a[i])?(a[i+1]=a[i]+a[i+1]-(a[i]=a[i+1])):a[i]=a[i];
(a[9-i]>a[10-i])?(a[9-i]=[10-i]+a[9-i]-(a[10-i]=a[9-i])):a[i]=a[i];
}
n++;
if(n<=5)
sortarray(a);
}
int main(void)
{
int array[10]={1,3,45,67,43,99,11,34,66,44};
sortarray(array);
for(i=0;i<10;i++){
printf("%d\t",array[i],10);
}
}
(a[i+1]