插入排序之直接插入排序Java实现

插入排序之直接插入排序Java实现

package com.mike.sort;

import java.util.Arrays;

public class InsertSort {
	/*
	 * 直接插入排序
	 */
	public static void insertSort(DataWrap[] data){
		for (int i = 1; i < data.length; i++) {
			DataWrap temp=data[i];
			if (data[i].compareTo(data[i-1])<0) {
				int j = i-1;
				for (; j>=0 && data[j].compareTo(temp)>0; j--) {
					data[j+1]=data[j];
				}
				data[j+1]=temp;
			}
			
		}
	}
    public static void main(String[] args) {  
        DataWrap[] dataWraps={  
                new DataWrap(21,""),  
                new DataWrap(31,""),  
                new DataWrap(2,""),  
                new DataWrap(2338,"*"),  
                new DataWrap(2122,""),  
                new DataWrap(22,""),  
                new DataWrap(55,""),  
                new DataWrap(134,""),  
                new DataWrap(24000,"")  
        };  
        System.out.println("排序之前："+Arrays.toString(dataWraps));  
        insertSort(dataWraps);  
        System.out.println("排序之后："+Arrays.toString(dataWraps));  
    }
}
/*
*定义一个数据包装类
*/
class DataWrap implements Comparable<DataWrap>{
	int data;
	String flag;
	public DataWrap() {
		// TODO Auto-generated constructor stub
	}
	public DataWrap(int data,String flag) {
		this.data=data;
		this.flag=flag;
	}
	@Override
	public String toString(){
		return data+flag;
	}
	@Override
	public int compareTo(DataWrap o) {
		// TODO Auto-generated method stub
		return this.data>o.data?1:(this.data==o.data?0:-1);
	}
}