java一维数组使用冒泡排序

nt[] array=new int[]{4，1，7，2，9，3，5，8，6}怎么给他从大到小排序并且取最大值和最小值并且用冒泡排序来解决，新手尽量给个翻译

 int arr [] ={4,1,7,2,9,3,5,8,6};
        //冒泡排序由大到小
        for (int i = 0; i < arr.length-1; i++）{
            for (int j = 0; j < arr.length-1 ; j++) {
                if (arr[j]<arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }

        //取得最大值
        int temp = -1;
        for (int i = 0; i < arr.length; i++) {
            if(arr[i]>temp){
                temp = arr[i];
            }
        }
        System.out.println(temp);

        int[] array=new int[]{4,1,7,2,9,3,5,8,6};
        for(int i=0;i<array.length;i++) {
            for(int j=0;j < array.length-1-i;j++) {
                if (array[j] < array[j+1]) {
                    int temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                }
            }
        }

public static void main(String args[]) {
    int[] arr = new int[]{4, 1, 7, 2, 9, 3, 5, 8, 6};
        int temp;// 定义一个临时变量
        for (int i = 0; i < arr.length - 1; i++) {// 冒泡趟数
            for (int j = 0; j < arr.length - i - 1; j++) {
                if (arr[j + 1] > arr[j]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
    for (int i = 0; i < arr.length; i++) {
        System.out.print(arr[i]);
    }

    System.out.println("最大值:" + arr[0] + " 最小值: " + arr[arr.length - 1]);

}