冒泡排序

import java.util.Arrays;import java.util.Scanner;public class BubbleSort {public static void sort(int[] a) {final int len = a.length;for (int i = len - 1; i > 0; i--) {for (int j = 0; j < i; j++) {if (a[j] > a[j + 1]) {final int tmp = a[j];a[j] = a[j + 1];a[j + 1] = tmp;}}}}public static void main(String[] args) {final Scanner sc = new Scanner(System.in);final String input = sc.nextLine();final String[] strs = input.split("\\s+");final int[] a = new int[strs.length];for (int i = 0; i < strs.length; i++) {a[i] = Integer.parseInt(strs[i]);}sort(a);String ans1 = Arrays.toString(a);System.out.println(ans1);Arrays.sort(a);String ans2 = Arrays.toString(a);System.out.println(ans1.equals(ans2));sc.close();}}