java编程基础（四）选择排序

选择排序运算逻辑分析

选择排序的运算逻辑是，挑选比i位置小的值交换到i位置

代码

package demo1;

import java.util.Arrays;
import java.util.Random;

public class SelectionSort {
    public static void main(String[] args) {
        int[] a = rnd();
        System.out.println(Arrays.toString(a));
        System.out.println("----------------------------");
        sort(a);
        System.out.println("----------------------------");
        System.out.println(Arrays.toString(a));
    }

    static void sort(int[] a) {
        for (int i=0;i<a.length;i++) {
            for (int j=i+1;j<a.length;j++) {
                if (a[i]>a[j]) {
                    int t = a[i];
                    a[i] = a[j];
                    a[j] = t;
                }
            }
            System.out.println(Arrays.toString(a));
        }
    }

    static int[] rnd() {
        int[] a = new int[5 + new Random().nextInt(6)];

        for (int i = 0; i < a.length; i++) {
            a[i] = new Random().nextInt(100);
        }

        return a;
    }
}

Q.E.D.