排序算法总结---选择排序

 1 public class Sra {
 2     public static void main(String[] args) {
 3         int score[] = { 36, 27, 9, 18, 40 };
 4 
 5         fun(score, 5);
 6         print(score);
 7     }
 8 
 9     public static void fun(int score[], int n) {
10         int min = 0;
11         for (int i = 0; i < n; i++) {
12             min = i;
13             for (int j = 1 + i; j < n; j++)
14                 if (score[min] > score[j])
15                     min = j;
16             int t = score[i];
17             score[i] = score[min];
18             score[min] = t;
19         }
20     }
21 
22     public static void print(int score[]) {
23         for (int i = 0; i < score.length; i++) {
24             System.out.print(score[i] + "\t");
25         }
26     }