冒泡排序 package com.test01;public class Array {public static void sorc(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]
          package com.test01;
public class Array {
	public static void sorc(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 printArr(int[] arr) {
		for (int i = 0; i < arr.length; i++) {
			System.out.println(" " + arr[i]);
		}
	}
}
        
        