数据结构之冒泡排序

 

 

 

public class ArraySort {
    public static void main(String[] args) {
        //定义数组
        int [] array = new int[]{4,3,5,2,7,8,1,9,6};
        //将数组进行排序操作，从小到大
        //冒泡排序
        for (int j = array.length; j >0 ; j++) {
            for (int i = 0; i < array.length-1; i++) {
                if(array[i]>array[i+1]){
                    int tmp = array[i+1];
                    array[i+1] = array[i];
                    array[i] = tmp;
                }
            }
        }
        System.out.println("从小到大排序后的结果是:");
        for(int j=0;j<array.length;j++){
            System.out.print(array[j]+" ");
        }

    }
}