1169: 绝对值排序

解题思路:

注意事项:

参考代码:

#include <stdio.h>

int main()

{

    int n,max,i;

    int a[100];

    int j;

    while(scanf("%d",&n)!=EOF)

    {

            if(n==0)

        {

            break;

        }

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

        {

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

        }

                for(j=0;j<n-1;j++)//冒泡排序 

                {

                        for(i=0;i<n-1;i++)

                    {

                            if(fabs(a[i])<fabs(a[i+1]))//绝对值比较 

                        {

                            max=a[i+1];

                            a[i+1]=a[i];

                            a[i]=max;

                        }

                     }

                 }

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

            {

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

            }

                printf("\n");

     }

        return 0;

}