絕對值排序
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40958 Accepted Submission(s): 20020
#include <stdio.h> #include <stdlib.h> #include <math.h> int main() { int i,j,t,n,flag,a[102]; while (scanf("%d",&n)!=EOF&&n!=0) { for (i=1;i<=n;i++) scanf("%d",&a[i]); for (i=1;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; } for (i=1,flag=0;i<=n;i++) { if(flag==0) { printf("%d",a[i]); flag++; } else printf(" %d",a[i]); } printf("\n"); } return 0; }調用函數比較大小,輸出注意格式