算法--排序

import java.util.Arrays;

public class MySort {
    public static void main(String[] args) {
        selectSort();
        bubbleSort();
    }

    
    private static void bubbleSort() {
        int[] data = {180, 4, 56, 777, 3, -1, 8, 23};
        for (int d = 0; d < data.length; d++) {
            for (int i = d; i < data.length; i++) {
                if(data[i] <= data[d]){
                    //交换
                    int temp = data[i];
                    data[i] = data[d];
                    data[d] = temp;
                }
            }
        }
        System.out.println(Arrays.toString(data));
    }

    
    private static void selectSort() {
        int[] data = {180, 4, 56, 777, 3, -1, 8, 23};
        for (int i = 0; i < data.length; i++) {
            int min = data[i];
            int pos = i;
            for (int j = i; j < data.length; j++) {
                //find min
                if(data[j] <= min){
                    min = data[j];
                    pos = j;
                }
            }
            //交换
            int temp = data[i];
            data[i] = min;
            data[pos] = temp;
        }
        System.out.println(Arrays.toString(data));
    }
}