插入排序之直接插入排序（java實現）

import java.util.Arrays;

public class InsertSort {

    public static void insertSort(DataWraper[] data){
        System.out.println("開始排序:");
        int arrayLength=data.length;
        for(int i=1;i<arrayLength;i++){
            //當整體後移是，保證data[i]的值不會丟失
            DataWraper tmp=data[i];
            //i索引處的值已經比前面所有值都大，表明已經有序，無需插入
            if(data[i].compareTo(data[i-1])<0){
                int j=i-1;
                //整體後移一格
                for(;j>=0&&data[j].compareTo(tmp)>0;j--){
                    data[j+1]=data[j];
                }
                //將tmp的值插入合適位置
                data[j+1]=tmp;
            }
            System.out.println(Arrays.toString(data));
        }
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        DataWraper [] data={
                new DataWraper(21, ""),
                new DataWraper(30, ""),
                new DataWraper(49, ""),
                new DataWraper(30, "*"),
                new DataWraper(16, ""),
                new DataWraper(9, ""),
               
        };
        System.out.println("排序之前：\n"+Arrays.toString(data));
        insertSort(data);
        System.out.println("排序之後：\n"+Arrays.toString(data));
    }

}

結果：

排序之前：
[21, 30, 49, 30*, 16, 9]
開始排序:
[21, 30, 49, 30*, 16, 9]
[21, 30, 49, 30*, 16, 9]
[21, 30, 30*, 49, 16, 9]
[16, 21, 30, 30*, 49, 9]
[9, 16, 21, 30, 30*, 49]
排序之後：
[9, 16, 21, 30, 30*, 49]