Mine

	public static void sort(int[] numbers){        int length = 0;        while(length<numbers.length){            printLOL(numbers);            for(int x = numbers.length-1; x>length; x--){                                if(numbers[x] < numbers[x-1]){                    //swap them                    numbers[x] ^= numbers[x-1];                    numbers[x-1] ^= numbers[x];                    numbers[x] ^= numbers[x-1];                    printLOL(numbers);                }            }            length++;        }    }