java 冒泡排序？

 

	// 冒泡循环
	public static void maopaoSort(int[] sortList) {
		//外层循环n-1
		for (int i = 0; i < sortList.length - 1; i++) {
			// 内层循环 n-1-i
			for (int j = 0; j < sortList.length - 1 - i; j++) {
				if (sortList[j] > sortList[j + 1]) {
					int temp = sortList[j];
					sortList[j] = sortList[j + 1];
					sortList[j + 1] = temp;
				}
			}
		}
		for (int i : sortList) {
			System.out.print(i + "\t");
		}
	}