First, select Sort
#include <stdio.h> #define N 10 / * of 10 number order. Program analysis: can be used to select sorting method. * / Int main () { int I, J, K; int A [N], TEMP; for (I = 0 ; I <N; I ++ ) Scanf ( " % D " , & A [I]) for (I = 0 ; I <N; I ++ ) { K = I; for (I = J + . 1 ; J <N; J ++ ) { IF (A [K] < A [J]) K =j; } if(k!=i) { temp=a[i]; a[i]=a[k]; a[k]=temp; } } for(i=0;i<N;i++) printf("%d",a[i]) return 0; }
Second, the bubble sort
#include <stdio.h> #define N 10 / * of 10 number order. Program Analysis: You can use bubble sort. * / Int main () { int I, J, T [N]; int min; for (I = 0 ; I <N; I ++ ) Scanf ( " % D " , & T [I]); for (I = 0 ; I <N- . 1 ; I ++ ) { for (J = 0 ; J <N- . 1 -i; J ++ ) { IF (T [J]> T [+ J . 1 ]) { min =t[j]; t[j]=t[j+1]; t[j+1]=min; } } } for(i=0;i<N;i++) printf("%d\t",t[i]); return 0; }