NYOJ 41 三个数从小到大排序

三个数从小到大排序

20 7 33

7 20 33

#include<stdio.h>
int main () {
int paixu (int a []) ;
int b [2] ;
paixu ( b ) ;
return 0 ;
}
int paixu(int a [2]){
int  i , j , temp ;
for(int i = 0 ;i < 3 ; i ++) {
scanf (" %d " , & a [i]);
if( a[i] <= 0)
return -1;
}
for(i = 0; i < 2; i + +){
int  m = i;
for(j = i + 1; j < 3; j + +)
if(a [j] < a [m]){
temp = a [m];  a [m] = a [j]; a [j] = temp;
}
} //选择排序法
printf("%d %d %d\n", a [0], a [1], a [2]);
return 0;
}