绝对值排序

解题思路:冒泡排序

注意事项:

参考代码:#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n;
    while(cin>>n&&n!=0)
    {
        int arry[n]={0};
        for(int a=0;a<n;a++)
        {
            int x;
            cin>>x;
            arry[a]=x;
        }
        for(int i=0;i<n-1;i++)
        {
            for(int j=0;j<n-i-1;j++)
            {
                if(abs(arry[j])<abs(arry[j+1]))
                {
                    int temp=arry[j];
                    arry[j]=arry[j+1];
                    arry[j+1]=temp;
                }
            }
        }
        for(int m=0;m<n;m++)
        {
            cout<<arry[m]<<" ";
        }cout<<endl;
    }
    return 0;
}