什么是插入排序？https://baike.baidu.com/item/%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F/7214992?fr=aladdin

解析：

public class InsertSort{
    public void insertSort(int[] array, int first ,int last){
        int temp,i,j;
        for(i = first +1;i<=last-1;i++){
            temp = array[i];
            j = i-1;
            while(j>=first && array[j]>temp){
                array[j+1] = array[j];
                j--;
            }
            array[j+1] =temp;
            
            //打印每次排序结果
            for(int m =0;m<=array.length -1;m++){
                System.out.println(array[m] + "\t");
            }
            System.out.println();
        }

    }
    
    public static void main(String args[]){
        InsertSort insertSort = new InsertSort();
        int[] array = {5,69,12,3,56,789,2,5648,23};

        insertSort.insertSort(array,0,array.length);
        for(int i=0;i<array.length -1;i++){
            System.out.print(array[i] + "\t");
        }
    }
}