冒泡排序

package day;

import java.util.Arrays;
/**
 * 冒泡排序
 * @author Administrator
 *
 */
public class Maopao {
    public static void method(int[] array){
        for(int i = array.length - 1;i >= 0;i --){
            for(int j = 0;j < i;j ++){
                if(array[j] > array[j + 1]){
                    swap(array, j, j + 1);
                }
            }
        }
    }
    private static void swap(int[] array, int k, int i) {
        int temp = array[k];
        array[k] = array[i];
        array[i] = temp;
    }
    public static void main(String[] args) {
        int[] a = {-1,2,-3,4,-5,6,-7,8,9};
        method(a);
        System.out.println(Arrays.toString(a));
    }
}