冒泡排序Java实现

package myJavaLib;

import java.util.*;

public class BubbleSort {

public static void bubbleSort(int[] arr) {
for (int i = 0; i != arr.length; i++) {

// 逐个与相邻元素比较，较大者不断后移（冒泡），至尾端。
for (int j = 0; j < arr.length -1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}

public static void printArray(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
System.out.print(arr[i] + " ");
}
System.out.println(arr[arr.length - 1]);
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int
;
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
sc.close();

bubbleSort(arr);
printArray(arr);
}

}