/**
*Implementation of pseudo code for bubble sort
* Sorting is done in Decending order
*
* @author Subham Mishra
**/


public static void BubbleSort( int [ ] num )
{
     int j;
     boolean flag = true;   // set flag to true to begin first pass
     int temp;   //holding variable

     while ( flag )
     {
            flag= false;    //set flag to false awaiting a possible swap
            for( j=0;  j < num.length -1;  j++ )
            {
                   if ( num[ j ] < num[j+1] )   // change to > for ascending sort
                   {
                           temp = num[ j ];                //swap elements
                           num[ j ] = num[ j+1 ];
                           num[ j+1 ] = temp;
                          flag = true;              //shows a swap occurred 
                  }
            }
      }
} 

@@ -112,16 +112,40 @@
 ra%0A**/%0A%0A
+public class BubbleSort%7B
 %0Apublic 
@@ -156,17 +156,17 @@
 ic void 
-B
+b
 ubbleSor
@@ -860,8 +860,10 @@
    %7D%0A%7D %0A
+%7D%0A

Update BubbleSort.java