冒泡排序

package basic_class_01;


/**
 * @Author qgfzzzzzz
 * @Date 19-2-28
 * @Version 1.0
 *
 * This Algorithm is bubblesort.
 * comfirm one maximum every time
 *
 * time : o(n * n)
 * space : o(1)
 *
 */
public class Code_00_BubbleSort {

    public static void bubbleSort(int[] arr){
        if(arr == null || arr.length < 2){
            return;
        }
        for(int i = arr.length - 1; i > 0; i--){
            for(int j = 0; j < i; j++){
                if(arr[j] > arr[j + 1]){
                    swap(arr, j, j + 1);
                }
            }
        }
    }

    public static void swap(int[] arr, int i, int j){
        arr[i] = arr[i] ^ arr[j];
        arr[j] = arr[i] ^ arr[j];
        arr[i] = arr[i] ^ arr[j];
    }

    public static void main(String[] args){
        int[] arr = {5, 8, 4, 6, 3, 9, 11};
        bubbleSort(arr);
        for(int k = 0; k < arr.length; k++){
            System.out.print(arr[k] + " ");
        }
    }

}