JAVA基础 面试三大排序

简单梳理这三种常见的排序，不做重复工作。

１冒泡排序

int[] arr = {3, 5, 6, 4, 2};
        int temp = 0 ;
        for (int i = 1; i < arr.length; i++) {
            for (int j = 0; j < arr.length-i; j++) {
                if (arr[j] > arr[j + 1]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.println("arr[" + i + "] : " + arr[i]);
        }

２选择排序

 int[] arr = {7, 5, 6, 4, 2};
        int temp = 0 ;
        int index = 0 ;
        for (int i = 0; i < arr.length - 1; i++) {
            temp = arr[i];
            index = i;
            //获取下标
            for (int j = i + 1; j < arr.length; j++) {
                if(arr[j] < arr[index]){
                    index = j;
                }
            }
            //交换值
            if(index != i){
                arr[i] = arr[index];
                arr[index] = temp;
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.println("arr[" + i + "] : " + arr[i]);
        }

３插入排序

 int[] arr = {7 , 5, 6, 4, 2};
        /*
         * 排序：略
         */
        int num = 3;
        int index = 0;
        //插入按序排序对应位置,找到下标
        for (int i = 0; i < arr.length; i++) {
            if(arr[i] > num){
                index = i;
                break;
            }
        }
        //移位置
        for (int i = arr.length-1; i > index; i--) {
            arr[i] =arr[i - 1];
        }
        arr[index] = num;
        for (int i = 0; i < arr.length; i++) {
            System.out.println("arr[" + i + "] : " + arr[i]);
        }