Java Code to reverse an array using bubble sort

Problem:

Design and implement a bubble sort that incorporates exchange in the reverse direction of fixed lenght

Solution:

package array.programs;

public class BubbleSort {
public static void main(String []args) {

     int[] array = {10,8,6,4,2,9,7,5,3,1};

     System.out.print("Before sort: " );    
     for(int x = 0; x < array.length; x++) {
        System.out.print( " " + array[x]);    
     }
     System.out.println(" ");    

     int remaining = array.length - 1;
     for(int x = 0; x < (array.length-1); x++) {
        for(int y = 0; y < (remaining); y++) {
           int tmp;
           if ( array[y] < array[y+1] ) {
             tmp =  array[y+1];
             array[y+1] = array[y];
             array[y] = tmp;
           }
        }
        remaining--;
     }

     System.out.print("After sort: " );    
     for(int x = 0; x < array.length; x++) {
        System.out.print( " " + array[x]);    
     }
     System.out.println(" ");    
  }
}

Output:

Before sort:  10 8 6 4 2 9 7 5 3 1
After sort:  10 9 8 7 6 5 4 3 2 1