排序算法之直接选择排序

/**
 * Created by tom on 2017-05-07.
 */
//创建对象数组来作为被排序的对象，在每个对象中加入标识，标识相同的数字

class DataWrap implements Comparable<DataWrap>{
    int data;
    String flag;
    public DataWrap(int data ,String flag){
        this.data=data;
        this.flag=flag;
    }

    @Override
    public String toString() {
        return data+flag;
    }

    //如果当前data大于dw,返回1；小于和等于返回数值不是1
    @Override
    public int compareTo(DataWrap dw) {
        return this.data>dw.data?1:(this.data==dw.data?0:-1);
    }
}

public class SelectSort {
    public static void SelectSort(DataWrap[] data){
        System.out.println("开始排序");
        int arrayLength=data.length;

        for (int i = 0; i < arrayLength-1; i++) {
            int minIndex=i;
            for (int j = i+1; j <arrayLength ; j++) {
                if(data[i].compareTo(data[j])>0){
                    //如果data[i]>data[j],则交换顺序
                    DataWrap temp=data[i];
                    data[i]=data[j];
                    data[j]=temp;
                }
            }
        }
    }

    public static void main(String[] args){
        DataWrap[] dataWrap={
                new DataWrap(21,""),
                new DataWrap(25,""),
                new DataWrap(31,""),
                new DataWrap(21,"*"),
                new DataWrap(1,""),
                new DataWrap(71,""),
                new DataWrap(2,""),
        };
        System.out.println("排序之前");
        System.out.println(java.util.Arrays.toString(dataWrap));
        SelectSort(dataWrap);
        System.out.println("排序之后");
        System.out.println(java.util.Arrays.toString(dataWrap));
    }
}