奇偶排序算法

public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        int[] numbers = new int[]{12,33,45,33,13,55,34,7,6};
        Main.oddEventSort(numbers);
        for(int i=0; i<numbers.length; i++){
            System.out.print(numbers[i]+" ");
        }
    }
    private static void oddEventSort(int[] numbers){
        int temp;
        for(int i=numbers.length-1; i>numbers.length/2-1; i--){
            for(int j=1; j<=i; j+=2){
                if(j==numbers.length-1)break;
                if(numbers[j]>numbers[j+1]){
                    temp = numbers[j];
                    numbers[j] = numbers[j+1];
                    numbers[j+1] = temp;
                }
            }
            for(int j=0; j<=i; j+=2){
                if(j==numbers.length-1)break;
                if(numbers[j]>numbers[j+1]){
                    temp = numbers[j];
                    numbers[j] = numbers[j+1];
                    numbers[j+1] = temp;
                }
           }
        }
    }
}

 据说在多核时代这个算法比较好用