60. 내림차순 선택 정렬의 교환 횟수

1public class Main {
2    public static void main(String[] args) {
3        int[] a = {6, 2, 9, 4, 7};
4        int swaps = 0;
5        for (int i = 0; i < a.length - 1; i++) {
6            int max = i;
7            for (int j = i + 1; j < a.length; j++) {
8                if (a[j] > a[max]) {
9                    max = j;
10                }
11            }
12            if (max != i) {
13                int t = a[i];
14                a[i] = a[max];
15                a[max] = t;
16                swaps++;
17            }
18            System.out.println(i + ": " + a[0] + a[1] + a[2] + a[3] + a[4]);
19        }
20        System.out.println("swaps=" + swaps);
21    }
22}