数据结构算法-冒泡选择插入排序

package com;

import sun.font.FontRunIterator;

import java.sql.Array;
import java.util.concurrent.ForkJoinPool;

public class Sort {
    //将arr[j]的值赋值给arr[i],arr[i]的值赋值给arr[j],俗称交换
    public static void swap(int[] arr, int i, int j) {
        int temp = arr[j];
        arr[j] = arr[i];
        arr[i] = temp;
    }

    //选择排序
    public static void selectSort(int[] arr) {

        if (arr == null || arr.length < 2) {
            return;
        }
        int N = arr.length;
        //0-n-1 1-n-1  2 - n-1
        for (int i = 0; i < N; i++) {
            int minValueIndex = i;
            //先找到最小值,并且找到位置
            for (int j = i + 1; j < N; j++) {
                minValueIndex = arr[j] < arr[minValueIndex] ? j : minValueIndex;
            }
            //在进行交换
            swap(arr, i, minValueIndex);
        }

    }

    //冒泡排序
    public static void bubbleSort(int[] arr) {
        if (arr == null || arr.length <= 2) {
            return;
        }
        //前两个数做交换
        int N = arr.length;
        //0-n-1上相互的俩谁大谁往后
        for (int end = N - 1; end >= 0; end--) {
            //0-end之间做事
            // 0-1 1-2 2-3 3-4 end-1-end
            for (int second = 1; second <= end; second++) {
                if (arr[second - 1] > arr[second]) {
                    swap(arr, second - 1, second);
                }
            }
        }

    }

    //插入排序
    public static void insertSort(int[] arr) {
        //0-0 0-1 0-2 0-3 0-n上做到有序
        if (arr == null || arr.length <= 2) {
            return;
        }
        int N = arr.length;
        //0-1 0-2 0-3
        for (int end = 1; end < N; end++) {
            int newNumIndex = end;
            while (newNumIndex - 1 >= 0 && arr[newNumIndex - 1] > arr[newNumIndex]) {
                swap(arr, newNumIndex - 1, newNumIndex);
                newNumIndex--;
            }
        }

    }

    public static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int arr[] = {6, 4, 7, 4, 1, 6, 8, 3, 1, 7};
        printArray(arr);
        System.out.println("----------");
        insertSort(arr);
        printArray(arr);
    }
}