絕對值排序
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62613 Accepted Submission(s): 30188
#include<stdio.h>
#include<stdlib.h>
int main(){
int n,list[100];
while(scanf("%d",&n)!=EOF && n){
memset(list,0,sizeof(list));
for(int i = 0;i<n;i++){
scanf("%d",&list[i]);
}
int temp;
for(int i = 1;i<n;i++){
for(int j = 0;j < n-i;j++){
if( abs(list[j+1])>= abs(list[j])){
temp = list[j];
list[j] = list[j+1];
list[j+1] = temp;
}
}
}
for(int i = 0;i < n;i++ ){
if(i == 0){
printf("%d",list[i]);
}else{
printf(" %d",list[i]);
}
}
printf("\n");
}
return 0;
}