数组（选择排序（2种），冒泡排序，求极值）

import java.util.Arrays;
import java.util.Scanner;

public class test {
    public static void main(String[] args) {
        int[] arr = {54, 65, 14, 23, 55};
//       MaoPao(arr);
//        ChoiceSort(arr);
//       ChoiceSortTwo(arr);
    }

    public static void ChoiceSortTwo(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) { //总共比arr.length - 1 趟
            for (int j = i+1; j < arr.length; j++) {
                if (arr[i] > arr[j]){
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
        }
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
    }

    public static void ChoiceSort(int[] arr) {
        int i, x, j, r;
        for (i = 0; i < arr.length - 1; i++) {//循环结束后，x中存储的最小值下标
            x = i; //x=0
            //找出最下值的下标
            for (j = i + 1; j < arr.length; j++) {
                if (arr[x] > arr[j])
                    x = j; 
            }
           //2.和查找范围内的第一个数进行交换
            if (x != i) {
                r = arr[x];
                arr[x] = arr[i];
                arr[i] = r;
            }
        }
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
    }

    public static void MaoPao(int[] arr) {
        int temp;
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - i - 1; j++) {
                if (arr[j] > arr[j + 1]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
    }

    public static void arrReverse(int[] arr) {
        int res;
        for (int i = 0; i <= arr.length / 2; i++) {
            res = arr[i];
            arr[i] = arr[arr.length - i - 1];
            arr[arr.length - i - 1] = res;
        }
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
    }

    public static void arrMin(int[] arr) {
        int min = arr[0];
        for (int i = 1; i < arr.length; i++) {
            if (min > arr[i]) {
                min = arr[i];

            }
        }
        System.out.println(min);
    }

    public static void arrMax(int[] arr) {
        int max = arr[0];
        for (int i = 1; i < arr.length; i++) {
            if (max < arr[i]) {
                max = arr[i];
            }
        }
        System.out.print(max);
    }

    public static void inputArr(int[] arr) {
        System.out.println("请连续输入" + arr.length + "个整数");
        Scanner scanner = new Scanner(System.in);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scanner.nextInt();
        }
    }

    public static void outputArr(int[] arr) {
        System.out.println("转化数组为：");
        for (int i = 0; i < arr.length; i++) {
            System.out.print("  arr[" + i + "]=" + arr[i]);
        }
    }
}