Sort method for sorting

Sort the array ：

// Sort the array

public  void  arraySort(){

    int[] arr = { 1,4,6,333,8,2};

    Arrays.sort(arr);// Use java.util.Arrays Object's sort Method

    for(int  i=0;i<arr.length;i++){

        System.out.println(arr[i]);

    }

}

Sort sets ：

// Yes list Ascending sort

    public  void  listSort1(){

        List<Integer> list = new  ArrayList<Integer>();

        list.add(1);

        list.add(55);

        list.add(9);

        list.add(0);

        list.add(2);

        Collections.sort(list);// Use Collections Of sort Method

        for(int  a :list){

            System.out.println(a);

        }

    }

    // Yes list null

    public  void  listSort2(){

        List<Integer> list = new  ArrayList<Integer>();

        list.add(1);

        list.add(55);

        list.add(9);

        list.add(0);

        list.add(2);

        Collections.sort(list, new  Comparator<Integer>() {

            public  int  compare(Integer o1, Integer o2) {

                return  o2 - o1;

            }

        });// Use Collections Of sort Method , And rewrite compare Method

        for(int  a :list){

            System.out.println(a);

        }

    }<br> Be careful ：Collections Of sort Methods are arranged in ascending order by default , If you need to arrange in descending order, you need to rewrite conpare Method




from ：http://www.cnblogs.com/minshia/p/6283858.html