JAVA 冒泡排序

package com.koal.test; /** * * @author hp * 冒泡排序 */ public class MaoPao { /** * @param args */ public static void main(String[] args) { int[] num = new int[7]; num[0] = 11; num[1] = 5; num[2] = 92; num[3] = 91; num[4] = 39; num[5] = 9; num[6] = 922; int length = num.length; for(int i=0;i<length;i++){ for(int j=length-1;j>i;j--){ //升序 asc if(num[i] > num[j]){ int temp = num[i]; num[i] = num[j]; num[j] = temp; } } } for(int i=0;i<length;i++){ System.out.println(num[i]); } } }