编写排序算法对CustomInteger对象进行排序

Question

null

 /**
  * @author AbduMuhaimin
  * @since 16/12/2015
  * Java Good Swap algorithm
  **/
//class CustomInteger

class CustomInteger {
    private int value;

    public CustomInteger(int i) {
        this.value = i;
    }
    public void setValue(int value) {
        this.value = value;
    }
    public int getValue() {
        return this.value;
    }

    public static void goodSwap(CustomInteger a, CustomInteger b) {
        CustomInteger z = new CustomInteger(a.getValue());
        a.setValue(b.getValue());
        b.setValue(z.getValue());
    }
    //main method
    public static void main(String[] args) {
        //before swapping
        CustomInteger a = new CustomInteger(10);
        CustomInteger b = new CustomInteger(5);
        System.out.println("Before swapping\n");
        System.out.println("Value of a: " + a.getValue() + "\n");
        System.out.println("Value of b: " + b.getValue() + "\n");

        //after swapping
        goodSwap(a,b);
        System.out.println("After swapping\n");
        System.out.println("Value of a: " + a.getValue() + "\n");
        System.out.println("Value of b: " + b.getValue() + "\n");
    }

}

Answer 1

    CustomInteger[] vec = new CustomInteger[]{new CustomInteger(5), new CustomInteger(1), new CustomInteger(2), new CustomInteger(4), new CustomInteger(5), new CustomInteger(2)};

    for (int i = 0; i < vec.length - 1; i++) {
        int min = i;
        for (int j = i + 1; j < vec.length; j++) {
            if (vec[j].getValue() < vec[min].getValue()) {
                min = j;
            }
        }
        if (min != i) {
            goodSwap(vec[i], vec[min]);
        }
    }

    for (int i = 0; i < vec.length; i++) {
        System.out.print(vec[i].getValue() + " ");
    }