JAVA 冒泡排序

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