数组排序的三种方法

import java.util.Arrays;

/**
 * Created by Administrator on 2016/6/5.
 * @author 我就是你们的小星星
 *
 * 冒泡排序
 */
@SuppressWarnings("all")
public class BubbleSort {
    public static void main(String[] args) {
        int [] nums = {3,2,5,1,9};
        positive(nums); //正序
        System.out.println("-----------------------------------");
        reverse(nums); //倒序
    }

    /**
     * 正序
     */
    public static void positive(int [] nums){
        for(int i = 0 ; i < nums.length-1 ; i++){
            for(int j = 0 ; j < nums.length-1-i ; j++ ){
                if(nums[j] > nums[j+1]){
                    int temp = nums[j];
                    nums[j] = nums[j+1];
                    nums[j+1] = temp;
                }
                System.out.println(Arrays.toString(nums));
            }
        }
    }
    /**
     * 倒序
     */
    public static void reverse(int [] nums){
        for(int i = 0 ; i < nums.length-1 ; i++){
            for(int j = 0 ; j < nums.length-1-i ; j++ ){
                if(nums[j] < nums[j+1]){
                    int temp = nums[j];
                    nums[j] = nums[j+1];
                    nums[j+1] = temp;
                }
                System.out.println(Arrays.toString(nums));
            }
        }
    }
}

package com.zhu.sort;
import java.util.Arrays;
/**
 * Created by idea on 2016/6/5.
 * @author 我就是你们的小星星
 *
 * 使用Arrays类的sort方法排序
 */
public class ArraySort {
    public static void main(String[] args) {
        Integer [] array = {2,4,6,1,9,3};
        positive(array); //正序
        reverse(array); //倒序
    }

    /**
     *正序
     */
    public static void positive(Integer[] array){
        Arrays.sort(array);
        System.out.println(Arrays.toString(array));
    }
    /**
     * 倒序
     */
    public static void reverse (Integer [] array){
        Arrays.sort(array, new java.util.Comparator<Integer>() {
            @Override
            public int compare(Integer num1, Integer num2) {
                return -(num1-num2);
            }
        });
        System.out.println(Arrays.toString(array));
    }
}

package com.zhu.sort;
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;

/**
 * Created by idea on 2016/6/5.
 * @author 我就是你们的小星星
 *
 * 使用TreeSet对数组进行排序
 */
public class TreeSort {
    public static void main(String[] args) {
        int [] data = {1,4,2,7,3,9,8,5};
        positive(data); //正序
        System.out.println(); //换行
        reverse(data); //倒序
    }

    /**
     * 正序
     */
    public static void positive(int [] data){
        TreeSet <Integer> treeSet = new TreeSet<Integer>();
        for(int i = 0 ; i < data.length ; i++){
            treeSet.add(data[i]);
        }
        for(Iterator iterator = treeSet.iterator();iterator.hasNext();){
            System.out.print(iterator.next() + " ");
        }
    }
    /**
     * 倒序
     */
    public static void reverse(int [] data){
        TreeSet <Integer> treeSet = new TreeSet<Integer>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return -(o1-o2);
            }
        });
        for(int i = 0 ; i < data.length ; i++){
            treeSet.add(data[i]);
        }
        for(Iterator iterator = treeSet.iterator();iterator.hasNext();){
            System.out.print(iterator.next() + " ");
        }

    }
}

package com.zhu.sort;
import java.util.Arrays;
/**
 * Created by idea on 2016/6/5.
 * @author 我就是你们的小星星
 * 
 * 数组的拷贝
 */
public class ArrayCopy {
    public static void main(String[] args) {
        //测试拷贝1
        String [] strings = {"1","2","3","4"};
        int [] data = arrCopy1(strings);
        System.out.println(Arrays.toString(data));
        //测试拷贝2
        int [] num = {1,2,3,4};
        int [] numbers = arrCopy2(num);
        System.out.println(Arrays.toString(numbers));
    }

    /**
     * 数组的拷贝1
     */
    public static int[] arrCopy1(String [] strings){
        int [] arr = new int [strings.length];
        for(int i = 0 ; i < strings.length ; i++){
            arr[i] =Integer.parseInt(strings[i]);
        }
        return arr;
    }
    /**
     * 数组的拷贝2
     */
    public static int[] arrCopy2(int [] num){
        int [] number = new int[num.length];
        // 参数1：源数组 参数2：源数组中的起始位置 参数3：目标数组
        // 参数4：目标数据中的起始位置 参数5：要复制的数组元素的数量。
        System.arraycopy(num , 0 , number , 0 , num.length);
        return number;
    }
}