6.排序-直插

插入排序算法思想：每趟将一个元素，按照其关键字的大小插入到它前面已经排序的子序列中，依此重复，直到插入全部元素。

 

package facehandjava.sort;

public class InsertSort {
    public static void main(String[] args) {
        int[]arrays = {10, 5, 36, 78,56,2, 5, 8, 9, 9};

        int min = 0;
        int max =arrays.length-1;
        System.out.print("原来的：");
        for(int i =0;i<=max;i++) {
            System.out.print(arrays[i]+",");
        }
        System.out.println();
        InsertSort(arrays,max);
        System.out.print("排序后：");
        for(int i =0;i<=max;i++) {
            System.out.print(arrays[i]+",");
        }

    }

    public static void InsertSort(int[] arrays,int max) {

        for (int i = 0; i < max; i++) {
            int j;
            int temp =arrays[i+1];
            for (j = i+ 1; j > 0 && temp < arrays[j-1]; j--) {
                arrays[j] = arrays[j - 1];
            }
            arrays[j] = temp;
        }
    }
}