构造了2个int数组(模拟含负整数、0、正整数)
package com.hylink.common; public class Maximum2 { /** * @function 冒泡排序 降序 升序 * @author ylchou@qq.com * @param args */ public static void main(String[] args) { int[] intArr = {-9,-20,-4,0,3,1,88,33,11,2,1,3}; int[] intArr2 = {-9,-20,-4,0,3,1,88,33,11,2,1,3}; int tmp = 0; //降序 for(int i=1; i<intArr.length; i++){//重点 for(int j=0; j<intArr.length; j++){ if(intArr[j] < intArr[i]){ tmp = intArr[i]; intArr[i] = intArr[j]; intArr[j] = tmp; } } } //升序 for(int i=1; i<intArr2.length; i++){//重点 for(int j=0; j<intArr2.length; j++){ if(intArr2[j] > intArr2[i]){ tmp = intArr2[i]; intArr2[i] = intArr2[j]; intArr2[j] = tmp; } } } System.out.print("冒泡排序后(降序):"); for(int i=0;i<intArr.length;i++){ System.out.print(intArr[i] + " "); } System.out.println(); System.out.print("冒泡排序后(升序):"); for(int i=0;i<intArr2.length;i++){ System.out.print(intArr2[i] + " "); } } }
console print:
冒泡排序后(降序):88 33 11 3 3 2 1 1 0 -4 -9 -20
冒泡排序后(升序):-20 -9 -4 0 1 1 2 3 3 11 33 88