Dumb Bubble Sort

import java.util.Arrays;
public class sort
{
    public static void main (String args []){
        System.out.println("\f");
        dumbBubbleSort();


}
    public static void dumbBubbleSort() {
     int [] nums = {22,11,9,6,3,2,1};
     for (int pass = 0; pass < nums.length - 1; pass++) {
        //The outer loop will achieve the bubbling up of the highest number each pass
           for (int i = 0; i < nums.length -1; i++) {
           // The inner loop of "neighbor comparisons" get shorter by one each time (because of intArray.length -1)
               if (nums[i] > nums[i+1]) {  //The "neighbor comparison"
                    //Swap
                    int temp = nums[i];        //To understand the need for temp, imagine trying to swap two glasses of
                    nums[i] = nums[i+1];   //juice...you will need a third glass.
                    nums[i+1] = temp;
               }
               System.out.println(Arrays.toString(nums));
          }
     }
}

}