写一个简单的冒泡排序类
public class Test {public static void sort(int[] data) {boolean flag;for (int i = 0; i < data.length - 1; i++) {flag = false;for (int j = 0; j < data.length - 1 - i; j++) {if (data[j] > data[j + 1]) {int temp = data[j];data[j] = data[j + 1];data[j + 1] = temp;flag = true;}}if (!flag)break;}}private static void print(int[] data) {for (int v : data) {System.out.print(v + " ");}System.out.println();}public static void main(String[] args) {int[] data = {100,50,21,111,88,69,177,322};System.out.println("排序前的数组是:");print(data);//排序前sort(data);//排序后System.out.println("\n排序后的数组是:");print(data);} }