10.冒泡排序 和 选择排序

package com.atguigu.java;

/**
 * @author hylstart
 * @create 2021-12-30 11:41
 */
public class code03 {
    public static void main(String[] args) {
        int[] arr1 = new int[]{2, 7, 5, 4, 8, 9, 1, 6};

        for (int e: arr1){
            System.out.print(e + " ");
        }

        System.out.println();

//        bubbleSort(arr1);
//        bubbleSort1(arr1);

//        selectSort(arr1);
        selectSort1(arr1);

        for (int e: arr1){
            System.out.print(e + " ");
        }
    }

    //冒泡排序01
    public static void bubbleSort(int[] arr){
        for (int i = 0; i < arr.length - 1; i++){
            for (int j = 0; j < arr.length - 1 - i; j++){
                if (arr[j] > arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
    }

    //冒泡排序02
    public static void bubbleSort1(int[] arr){
        for (int i = arr.length - 1; i >= 0; i--){
            for (int j = 0; j < i; j++){
                if (arr[j] > arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
    }

    //选择排序01
    public static void selectSort(int[] arr){
        for (int end = arr.length - 1; end >= 0; end--){
            int indexOfMax = 0;
            int max = arr[0];//在循环过程中起作用：筛选出最大值

            for (int i = 0; i <= end; i++){
                if (arr[i] > max){
                    indexOfMax = i;
                    max = arr[i];
                }
            }

            int temp = arr[end];
            arr[end] = arr[indexOfMax];
            arr[indexOfMax] = temp;

        }
    }

    //选择排序02
    public static void selectSort1(int[] arr){
        for (int i = 0; i < arr.length- 1; i++){
            int indexOfMin = i;
            int min = arr[i];

            for (int j = i + 1; j < arr.length; j++){
                if (arr[j] < min){
                    min = arr[j];
                    indexOfMin = j;
                }
            }

            int temp = arr[i];
            arr[i] = arr[indexOfMin];
            arr[indexOfMin] = temp;
        }
    }



}