java冒泡排序法：

public class Test8 {
    public static void main(String[] args) {
        int [] arry = {12,3,42,4,5,23};
        for (int j=0;j<=arry.length-1;j++){
            for (int i = 0; i < arry.length-j-1; i++) {
                if (arry[i]>arry[i+1]) {
                    int temp;
                    temp = arry[i];
                    arry[i] = arry[i+1];
                    arry[i+1] = temp;
                }
            }
        }
        for (int i = 0; i < arry.length; i++) {
            System.out.println(arry[i]);
        }
    }
}