题解 1169: 绝对值排序

#include<stdio.h>
#include<math.h>

int main()
{
    int i,j,t,n;
    while(scanf("%d",&n)!=EOF&&n!=0)
    {
        int a[n];
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        //冒泡排序
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
            {
                if(abs(a[i])< abs(a[j]))//一个数与后一个数进行比较，小于就互换
                {
                    t=a[i];
                    a[i]=a[j];
                    a[j]=t;
                }
            }
            printf("%d ",a[i]);
        }
        printf("\n");
    }
    return 0;
}