冒泡排序-Java-从大到小排列

package com.baidu.排序;

import java.util.Arrays;

public class Demo冒泡
{
    public static void main(String[] args)
    {
        int[] a = {1,3,2,5,57,46,37,28,11};
        int[] sort = sort(a);
        System.out.println(Arrays.toString(sort));


    }
    public static int[] sort(int[] array)
    {
        int temp = 0;
        for (int i = 0; i <array.length-1 ; i++)
        {
            for (int j = 0; j < array.length-1-i; j++)
            {
             if(array[j+1]>array[j]) 
               {   
                   temp = array[j];
                   array[j] =array[j+1];
                   array[j+1] = temp;
               }
            }
        }
         return array;
    }
}