试一下这个博客

/*
	Java Bublle Sort Descending Order Example
	This Java bublle sort example shows how to sort an array of int in descending
	order using bublle sort algorithm. 
*/
 class BublleSortDenscendingOrder
{
	public static void main(String[] args) 
	{
		//create an int array we want to sort using bublle sort algorithm
		int intArray[]=new int[]{5,90,34,45,561,5,4,6}; 

		//print array before sorting using bublle sort algorithm
		System.out.println("Array Before Bublle Sort");
		for (int i=0;i<intArray.length ; i++)
		{
			System.out.println("intArray["+i+"]="+intArray[i]);
		}

		//sort an array in descending order using bulle sort algorithm
		bublleSort(intArray);

		System.out.println("");

		//print array after sorting using bublle sort algorithm
		System.out.println("Array after Bublle Sort");
		for (int i=0;i<intArray.length ; i++)
		{
			System.out.println("intArray["+i+"]="+intArray[i]);
		}
	}

	private static void bublleSort(int[] intArray)
	{

			/*
			*思路
			*In bublle sort,we basically traverse the array from first
			 *to array_length - 1 position and compare the element with the next one.
			 *Element is swapped with the next element if the element is smaller.
			 *步骤
			 *Bublle sort steps are as follows.
			 *
			 *1.Compare array[0]&array[1]
			 *2.If array[0]<array[1] swap it.
			 *3.Compare array[1]&array[2] 
			 *4.If array[1]<array[2] swap it.
			 * ...
			 * 5. Compare array[n-1] & array[n]
			 * 6. if [n-1] < array[n] then swap it.
			 *
			 *After this step we will have smallest element at the last index.
			 *Repeat the same steps for array[1] to array[n-1]
			 */
	
		int n=intArray.length;
		int temp=0;
		
		for (int i=0;i<n ;i++ )
		{
			for (int j=1;j<(n-i) ;j++ )
			{
				
				if (intArray[j-1]<intArray[j])
				{
					//swap the elements!
					temp=intArray[j-1];
					intArray[j-1]=intArray[j];
					intArray[j]=temp;
				}
			}
		}
	}

	private static void printArray(int[] intArray)

		/*
			打印数组
			easy
			循环遍历数组并打印
		*/
}

试一下这个博客