冒泡排序

package util;

import org.junit.Test;

import java.util.Arrays;

/**
 * Copyright (C), 2018-2021, Mr.Lin
 * Author: Mr.Lin
 * Date: 2021/11/6 14:26
 * FileName: BubbleSort
 * Description: 冒泡排序
 */
public class BubbleSort {
    public static void main(String[] args) {
        int[] mun = {15, 55, 36, 99, 45, 11, 12, 33};
        for (int i = 0; i < mun.length - 1; i++) {
            for (int j = 0; j < mun.length - 1 - i; j++) {
                if (mun[j] < mun[j + 1]) {
                    int tomp = mun[j + 1];
                    mun[j + 1] = mun[j];
                    mun[j] = tomp;
                }
            }
        }
        int[] num = {15, 66, 33, 78, 99, 44, 51, 22,55};
        for (int a = 0; a < num.length; a++) {
            int minIdext = a;
            for (int b = a; b < num.length; b++) {
                if (num[b] > num[minIdext]) {
                    minIdext=b;
                }
            }
           int temp= num[minIdext];
            num[minIdext]=num[a];
            num[a]=temp;
        }

        int num1[]={999,55,66,2,64,4,55,112,11};
        for (int c = 1; c < num1.length; c++) {
            int n=num1[c];
            int d;
            for (d= c-1; d >=0 ; d--) {
                if(n<num1[d]){
                    num1[d+1]=num1[d];
                }else {
                    break;
                }
            }
            num1[d+1]=n;
        }
        System.out.println(Arrays.toString(num1));//插入比较
        System.out.println(Arrays.toString(num));//选择排序
        System.out.println(Arrays.toString(mun));
    }
}